Safe Haskell | None |
---|---|
Language | Haskell2010 |
Collection of the ported monad-based functions for supermonads.
For a more detailed description of these functions refer to
the Monad
module.
Most functions are generalized to suite the setting of supermonads better.
This module is thought as a replacement for the Control.Monad module.
- mapM :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => (a -> m b) -> [a] -> n [b]
- mapM_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => (a -> m b) -> [a] -> n ()
- forM :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => [a] -> (a -> m b) -> n [b]
- forM_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => [a] -> (a -> m b) -> n ()
- sequence :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => [m b] -> n [b]
- sequence_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => [m b] -> n ()
- (=<<) :: (Bind m n p, BindCts m n p a b) => (a -> n b) -> m a -> p b
- (>=>) :: (Bind m n p, BindCts m n p b c) => (a -> m b) -> (b -> n c) -> a -> p c
- (<=<) :: (Bind m n p, BindCts m n p b c) => (b -> n c) -> (a -> m b) -> a -> p c
- forever :: (Bind m n n, BindCts m n n a b) => m a -> n b
- void :: (CFunctor m, CFunctorCts m a ()) => m a -> m ()
- void' :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n a ()) => m a -> n ()
- join :: (Bind m n p, BindCts m n p (n a) a) => m (n a) -> p a
- filterM :: (Bind m n n, BindCts m n n Bool [a], Return n, ReturnCts n [a], CFunctorCts n [a] [a]) => (a -> m Bool) -> [a] -> n [a]
- mapAndUnzipM :: (Return n, ReturnCts n [(b, c)], Bind m n n, BindCts m n n (b, c) [(b, c)], CFunctorCts n [(b, c)] ([b], [c]), CFunctorCts n [(b, c)] [(b, c)]) => (a -> m (b, c)) -> [a] -> n ([b], [c])
- zipWithM :: (Return n, ReturnCts n [c], Bind m n n, BindCts m n n c [c], CFunctorCts n [c] [c]) => (a -> b -> m c) -> [a] -> [b] -> n [c]
- zipWithM_ :: (Return n, ReturnCts n [c], Bind m n n, BindCts m n n c [c], CFunctorCts n [c] (), CFunctorCts n [c] [c]) => (a -> b -> m c) -> [a] -> [b] -> n ()
- foldM :: (Foldable t, Return m, ReturnCts m b, Bind m n m, BindCts m n m b b) => (b -> a -> n b) -> b -> t a -> m b
- foldM_ :: (Foldable t, Return m, ReturnCts m b, Bind m n m, BindCts m n m b b, CFunctorCts m b ()) => (b -> a -> n b) -> b -> t a -> m ()
- replicateM :: (Return n, ReturnCts n [a], Bind m n n, BindCts m n n a [a], CFunctorCts n [a] [a]) => Int -> m a -> n [a]
- replicateM_ :: (Return n, ReturnCts n [a], Bind m n n, BindCts m n n a [a], CFunctorCts n [a] (), CFunctorCts n [a] [a]) => Int -> m a -> n ()
- when :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n () ()) => Bool -> m () -> n ()
- unless :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n () ()) => Bool -> m () -> n ()
- liftM :: (CFunctor m, CFunctorCts m a b) => (a -> b) -> m a -> m b
- liftM' :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b
- liftM2 :: (Bind m n p, BindCts m n p a c, CFunctorCts n b c) => (a -> b -> c) -> m a -> n b -> p c
- liftM3 :: (Bind m q q, BindCts m q q a d, Bind n p q, BindCts n p q b d, CFunctorCts p c d) => (a -> b -> c -> d) -> m a -> n b -> p c -> q d
- ap :: (Bind m n p, BindCts m n p (a -> b) b, CFunctorCts n a b) => m (a -> b) -> n a -> p b
- (<$!>) :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b
- (<$>) :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b
- ifThenElse :: Bool -> a -> a -> a
Control.Monad
replacements
Basic supermonad functions
mapM :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => (a -> m b) -> [a] -> n [b] Source #
Map the given function on each element of the list and collect the results.
mapM_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => (a -> m b) -> [a] -> n () Source #
mapM
ignoring the result.
forM :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => [a] -> (a -> m b) -> n [b] Source #
forM_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => [a] -> (a -> m b) -> n () Source #
forM
ignoring the result.
sequence :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] [b]) => [m b] -> n [b] Source #
Execute all computations in the list in order and returns the list of results.
sequence_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], CFunctorCts n [b] (), CFunctorCts n [b] [b]) => [m b] -> n () Source #
sequence
ignoring the result.
(=<<) :: (Bind m n p, BindCts m n p a b) => (a -> n b) -> m a -> p b infixr 1 Source #
Same as >>=
, but with the arguments interchanged.
(>=>) :: (Bind m n p, BindCts m n p b c) => (a -> m b) -> (b -> n c) -> a -> p c infixr 1 Source #
Left-to-right Kleisli composition.
(<=<) :: (Bind m n p, BindCts m n p b c) => (b -> n c) -> (a -> m b) -> a -> p c infixr 1 Source #
Right-to-left Kleisli composition.
forever :: (Bind m n n, BindCts m n n a b) => m a -> n b Source #
Execute the given computation repeatedly forever.
void :: (CFunctor m, CFunctorCts m a ()) => m a -> m () Source #
Ignore the result of a computation.
void' :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n a ()) => m a -> n () Source #
Ignore the result of a computation, but allow morphing the computational type.
Generalizations of list functions
filterM :: (Bind m n n, BindCts m n n Bool [a], Return n, ReturnCts n [a], CFunctorCts n [a] [a]) => (a -> m Bool) -> [a] -> n [a] Source #
Like filter
but with a monadic predicate and result.
mapAndUnzipM :: (Return n, ReturnCts n [(b, c)], Bind m n n, BindCts m n n (b, c) [(b, c)], CFunctorCts n [(b, c)] ([b], [c]), CFunctorCts n [(b, c)] [(b, c)]) => (a -> m (b, c)) -> [a] -> n ([b], [c]) Source #
Map a given monadic function on the list and the unzip the results.
zipWithM :: (Return n, ReturnCts n [c], Bind m n n, BindCts m n n c [c], CFunctorCts n [c] [c]) => (a -> b -> m c) -> [a] -> [b] -> n [c] Source #
Zip together two list using a monadic function.
zipWithM_ :: (Return n, ReturnCts n [c], Bind m n n, BindCts m n n c [c], CFunctorCts n [c] (), CFunctorCts n [c] [c]) => (a -> b -> m c) -> [a] -> [b] -> n () Source #
Same as zipWithM
, but ignores the results.
foldM :: (Foldable t, Return m, ReturnCts m b, Bind m n m, BindCts m n m b b) => (b -> a -> n b) -> b -> t a -> m b Source #
Fold the given foldable using a monadic function.
See foldl
.
foldM_ :: (Foldable t, Return m, ReturnCts m b, Bind m n m, BindCts m n m b b, CFunctorCts m b ()) => (b -> a -> n b) -> b -> t a -> m () Source #
Same as foldM
, but ignores the result.
replicateM :: (Return n, ReturnCts n [a], Bind m n n, BindCts m n n a [a], CFunctorCts n [a] [a]) => Int -> m a -> n [a] Source #
Repeats the given monadic operation for the given amount of times and returns the accumulated results.
replicateM_ :: (Return n, ReturnCts n [a], Bind m n n, BindCts m n n a [a], CFunctorCts n [a] (), CFunctorCts n [a] [a]) => Int -> m a -> n () Source #
Same as replicateM
, but ignores the results.
Conditional execution of monadic expressions
when :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n () ()) => Bool -> m () -> n () Source #
When the condition is true do the given action.
unless :: (Return n, ReturnCts n (), Bind m n n, BindCts m n n () ()) => Bool -> m () -> n () Source #
When the condition is false do the given action.
Monadic lifting operators
liftM :: (CFunctor m, CFunctorCts m a b) => (a -> b) -> m a -> m b Source #
Make arguments and result of a pure function monadic.
liftM' :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b Source #
Make arguments and result of a pure function monadic with allowed morphing
liftM2 :: (Bind m n p, BindCts m n p a c, CFunctorCts n b c) => (a -> b -> c) -> m a -> n b -> p c Source #
Make arguments and result of a pure function monadic.
liftM3 :: (Bind m q q, BindCts m q q a d, Bind n p q, BindCts n p q b d, CFunctorCts p c d) => (a -> b -> c -> d) -> m a -> n b -> p c -> q d Source #
Make arguments and result of a pure function monadic.
ap :: (Bind m n p, BindCts m n p (a -> b) b, CFunctorCts n a b) => m (a -> b) -> n a -> p b Source #
Make the resulting function a monadic function.
Strict monadic functions
(<$!>) :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b Source #
Strict version of <$>
.
Additional generalized supermonad functions
(<$>) :: (Return n, ReturnCts n b, Bind m n n, BindCts m n n a b) => (a -> b) -> m a -> n b Source #
Apply the given function to the result of a computation.
Addition due to RebindableSyntax
ifThenElse :: Bool -> a -> a -> a Source #
Standard implementation of if-then-else. Necessary because we are
going to use RebindableSyntax
together with this prelude.