Control.Monad.Free

Documentation

class (Functor f, Monad m) => MonadFree f m | m -> f where

Methods

wrap :: f (m a) -> m a

Instances

MonadFree f m => MonadFree f (ListT m)

MonadFree f m => MonadFree f (IdentityT m)

MonadFree f m => MonadFree f (MaybeT m)

Functor f => MonadFree f (Free f)

(MonadFree f m, Error e) => MonadFree f (ErrorT e m)

(MonadFree f m, Monoid w) => MonadFree f (WriterT w m)

(MonadFree f m, Monoid w) => MonadFree f (WriterT w m)

MonadFree f m => MonadFree f (StateT s m)

MonadFree f m => MonadFree f (StateT s m)

MonadFree f m => MonadFree f (ReaderT e m)

(MonadFree f m, Monoid w) => MonadFree f (RWST r w s m)

(MonadFree f m, Monoid w) => MonadFree f (RWST r w s m)

data Free f a

Constructors

Pure a

Free (f (Free f a))

Instances

MonadTrans Free

Functor f => MonadFree f (Free f)

Functor f => Monad (Free f)

Functor f => Functor (Free f)

(Functor v, MonadPlus v) => MonadPlus (Free v)

Functor f => Applicative (Free f)

Foldable f => Foldable (Free f)

Traversable f => Traversable (Free f)

Alternative v => Alternative (Free v)

Traversable1 f => Traversable1 (Free f)

Foldable1 f => Foldable1 (Free f)

Functor f => Apply (Free f)

Functor f => Bind (Free f)

(Eq (f (Free f a)), Eq a) => Eq (Free f a)

(Ord (f (Free f a)), Ord a) => Ord (Free f a)

(Read (f (Free f a)), Read a) => Read (Free f a)

(Show (f (Free f a)), Show a) => Show (Free f a)

iter :: Functor f => (f a -> a) -> Free f a -> a

retract :: Monad f => Free f a -> f a

retract . lift = id | retract . liftF = id