|
|
|
|
Synopsis |
|
|
|
Documentation |
|
(<.>) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c | Source |
|
|
|
|
|
|
|
|
|
|
|
|
|
Depending on the monad you have to look at the result for
the force to be effective. For the IO monad you do.
|
|
|
|
type Cont r a = (a -> r) -> r | Source |
|
|
|
mapM for the continuation monad. Terribly useful.
|
|
zipWithM' :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c] | Source |
|
Requires both lists to have the same lengths.
|
|
|
Finally for the Error class. Errors in the finally part take
precedence over prior errors.
|
|
|
:: (Error e, MonadError e m) | | => m a | Releases resource. Run last.
| -> a -> m c | Computes result. Run in-between.
| -> a -> m b | | -> m b | | Bracket for the Error class.
|
|
|
|
|
|
|
|
|
|
An infix synonym for fmap.
|
|
|
Sequential application.
|
|
Produced by Haddock version 2.6.0 |