Algebra.Monad.Foldable

The MonadList class

class Monad m => MonadList m where

Methods

fork :: [a] -> m a

Instances

MonadList []

Monad m => MonadList (ListT m)

MonadList m => MonadList (StateT s m)

MonadList m => MonadList (ReaderT r m)

(Monoid w, MonadList m) => MonadList (WriterT w m)

(Monad m, Ring t, Fractional t) => MonadList (ProbT t m)

(Monoid w, MonadList m) => MonadList (RWST r w s m)

Foldable monads transformers

The List transformer

data ListT m a

Instances

MonadTrans ListT

Monad m => MonadError Void (ListT m)

MonadWriter w m => MonadWriter w (ListT m)

MonadState s m => MonadState s (ListT m)

Unit m => Unit (ListT m)

Monad m => MonadList (ListT m)

MonadFix m => MonadFix (ListT m)

Traversable m => Traversable (ListT m)

Foldable m => Foldable (ListT m)

Monad m => Monad (ListT m)

Applicative m => Applicative (ListT m)

Functor m => Functor (ListT m)

Applicative m => Monoid (ListT m a)

Applicative m => Semigroup (ListT m a)

listT :: Iso (ListT m a) (ListT m' a') (m [a]) (m' [a'])

The Tree transformer

newtype TreeT m a

Constructors

TreeT (Compose' Tree m a)

Instances

MonadTrans TreeT

Unit m => Unit (TreeT m)

MonadFix m => MonadFix (TreeT m)

Traversable m => Traversable (TreeT m)

Foldable m => Foldable (TreeT m)

Monad m => Monad (TreeT m)

Applicative m => Applicative (TreeT m)

Functor m => Functor (TreeT m)

treeT :: Iso (TreeT m a) (TreeT n b) (m (Tree a)) (n (Tree b))

The Maybe transformer

newtype MaybeT m a

Constructors

MaybeT (Compose' Maybe m a)

Instances

MonadTrans MaybeT

Unit m => Unit (MaybeT m)

MonadFix m => MonadFix (MaybeT m)

Traversable m => Traversable (MaybeT m)

Foldable m => Foldable (MaybeT m)

Monad m => Monad (MaybeT m)

Applicative m => Applicative (MaybeT m)

Functor m => Functor (MaybeT m)

maybeT :: Iso (MaybeT m a) (MaybeT m' b) (m (Maybe a)) (m' (Maybe b))