Control.Monad.Free.Class

class MonadFree :: (Type -> Type) -> (Type -> Type) -> Constraintclass (Monad m) <= MonadFree f m | m -> f where

Based on http://hackage.haskell.org/package/free/docs/Control-Monad-Free-Class.html

Members

• wrapFree :: forall a. f (m a) -> m a

Instances

• MonadFree f (Free f)
• (Functor f, MonadFree f m) => MonadFree f (ReaderT r m)
• (Functor f, MonadFree f m) => MonadFree f (StateT s m)
• (Functor f, MonadFree f m, Monoid w) => MonadFree f (WriterT w m)
• (Functor f, MonadFree f m) => MonadFree f (MaybeT m)
• (Functor f, MonadFree f m) => MonadFree f (ExceptT e m)