CurryInfo: transformers-3.0.0 / Control.Monad.Trans.Reader.mapReaderT
definition: 
|
mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b mapReaderT f m = ReaderT $ f . runReaderT m |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
| Maps the computation inside the reader monad. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
mapReaderT |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(a b -> c d) -> ReaderT e a b -> ReaderT e c d |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |