CurryInfo: transformers-3.0.0 / Control.Monad.Trans.Reader.mapReaderT

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