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

definition:
 
withReaderT :: (s -> r) -> ReaderT r m a -> ReaderT s m a
withReaderT f m = ReaderT $ \s -> runReaderT m (f s)
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
| Runs a computation in a modified environment.
failfree:
 (_, _)
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,_) |-> _}
name:
 withReaderT
precedence:
 no precedence defined
result-values:
 _
signature:
 (a -> b) -> ReaderT b c d -> ReaderT a c d
solution-complete:
 operation might suspend on free variables
terminating:
 yes
totally-defined:
 reducible on all ground data terms