Control.Super.Monad.Constrained.Prelude

Custom prelude to use if supermonads need to support constrained monads as well.

Supermonads

module Control.Super.Monad.Constrained

Replacement functions

mapM_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], FunctorCts n [b] (), FunctorCts n [b] [b]) => (a -> m b) -> [a] -> n ()

mapM ignoring the result.

sequence_ :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], FunctorCts n [b] (), FunctorCts n [b] [b]) => [m b] -> n ()

sequence ignoring the result.

(=<<) :: (Bind m n p, BindCts m n p a b) => (a -> n b) -> m a -> p b infixr 1

Same as >>=, but with the arguments interchanged.

Traversable replacement functions

mapM :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], FunctorCts n [b] [b]) => (a -> m b) -> [a] -> n [b]

Map the given function on each element of the list and collect the results.

sequence :: (Return n, ReturnCts n [b], Bind m n n, BindCts m n n b [b], FunctorCts n [b] [b]) => [m b] -> n [b]

Execute all computations in the list in order and returns the list of results.

Fix rebindable syntax

ifThenElse :: Bool -> a -> a -> a

Standard implementation of if-then-else. Necessary because we are going to use RebindableSyntax together with this prelude.

Prelude functions

module Control.Super.Monad.PreludeWithoutMonad