| definition: |
mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b mapMaybeT f = MaybeT . f . runMaybeT |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {.._#lambda508}}
|
| name: |
mapMaybeT |
| precedence: |
no precedence defined |
| result-values: |
{.._#lambda508}
|
| signature: |
(a (Prelude.Maybe b) -> c (Prelude.Maybe d)) -> MaybeT a b -> MaybeT c d |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |