Control.Monad.HT

Documentation

(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c infixr 1

Also present in newer versions of the base package.

repeat :: Monad m => m a -> m [a]

Monadic repeat.

until :: Monad m => (a -> Bool) -> m a -> m a

repeat action until result fulfills condition

untilM :: Monad m => (a -> Bool) -> m a -> m a

Deprecated: use M.until

repeat action until result fulfills condition

iterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a]

parameter order equal to that of nest

iterateLimitM :: Monad m => Int -> (a -> m a) -> a -> m [a]

Deprecated: use M.iterateLimit

parameter order equal to that of nest

andLazy :: Monad m => m Bool -> m Bool -> m Bool

Lazy monadic conjunction. That is, when the first action returns False, then False is immediately returned, without running the second action.

orLazy :: Monad m => m Bool -> m Bool -> m Bool

Lazy monadic disjunction. That is, when the first action returns True, then True is immediately returned, without running the second action.

void :: Monad m => m a -> m ()

for :: Monad m => [a] -> (a -> m b) -> m [b]

map :: Monad m => (a -> m b) -> [a] -> m [b]

zipWith :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c]

chain :: Monad m => [a -> m a] -> a -> m a

filter :: Monad m => (a -> m Bool) -> [a] -> m [a]

replicate :: Monad m => Int -> m a -> m [a]

lift :: Monad m => (a -> r) -> m a -> m r

lift2 :: Monad m => (a -> b -> r) -> m a -> m b -> m r

lift3 :: Monad m => (a -> b -> c -> r) -> m a -> m b -> m c -> m r

lift4 :: Monad m => (a -> b -> c -> d -> r) -> m a -> m b -> m c -> m d -> m r

lift5 :: Monad m => (a -> b -> c -> d -> e -> r) -> m a -> m b -> m c -> m d -> m e -> m r

liftJoin2 :: Monad m => (a -> b -> m c) -> m a -> m b -> m c

liftJoin3 :: Monad m => (a -> b -> c -> m d) -> m a -> m b -> m c -> m d

liftJoin4 :: Monad m => (a -> b -> c -> d -> m e) -> m a -> m b -> m c -> m d -> m e

liftJoin5 :: Monad m => (a -> b -> c -> d -> e -> m f) -> m a -> m b -> m c -> m d -> m e -> m f