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

definition:
 
reader :: Monad m => (r -> a) -> ReaderT r m a
reader = asks
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
| Performs a computation in the reader monad (equivalent to asks).
failfree:
 _
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_) |-> {asks}}
name:
 reader
precedence:
 no precedence defined
result-values:
 {asks}
signature:
 Prelude.Monad c => (a -> b) -> ReaderT a c b
solution-complete:
 operation might suspend on free variables
terminating:
 possibly non-terminating
totally-defined:
 reducible on all ground data terms