| definition: |
mapExceptT :: (m (Either e a) -> n (Either e' b))
-> ExceptT e m a
-> ExceptT e' n b
mapExceptT f m = ExceptT $ f (runExceptT m)
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
mapExceptT |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a (Prelude.Either b c) -> d (Prelude.Either e f)) -> ExceptT b a c -> ExceptT e d f |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |