fold package:free

fold :: Monad m => (m a -> a) -> IterT m a -> a
free Control.Monad.Trans.Iter
Tear down a Free Monad using iteration.
foldFree :: Monad m => (forall x . f x -> m x) -> Free f a -> m a
free Control.Monad.Free
The very definition of a free monad is that given a natural transformation you get a monad homomorphism.
foldFree :: (Applicative f, Monad m) => (forall x . f x -> m x) -> Free f a -> m a
free Control.Monad.Free.Ap
Given an applicative homomorphism, you get a monad homomorphism.
foldF :: Monad m => (forall x . f x -> m x) -> F f a -> m a
free Control.Monad.Free.Church
The very definition of a free monad is that given a natural transformation you get a monad homomorphism.
foldFreeT :: (MonadTrans t, Monad (t m), Monad m) => (forall n x . Monad n => f x -> t n x) -> FreeT f m a -> t m a
free Control.Monad.Trans.Free
The very definition of a free monad transformer is that given a natural transformation you get a monad transformer homomorphism.
foldM :: (Monad m, Monad n) => (m (n a) -> n a) -> IterT m a -> n a
free Control.Monad.Trans.Iter
Like fold with monadic result.
unfold :: Functor f => (b -> (a, f b)) -> b -> Cofree f a
free Control.Comonad.Cofree
Unfold a cofree comonad from a seed.
unfoldM :: (Traversable f, Monad m) => (b -> m (a, f b)) -> b -> m (Cofree f a)
free Control.Comonad.Cofree
Unfold a cofree comonad from a seed, monadically.
unfold :: Comonad w => (w a -> a) -> w a -> CoiterT w a
free Control.Comonad.Trans.Coiter
Unfold a CoiterT comonad transformer from a cokleisli arrow and an initial comonadic seed.
unfold :: Functor f => (b -> Either a (f b)) -> b -> Free f a
free Control.Monad.Free
Unfold a free monad from a seed.
unfoldM :: (Traversable f, Monad m) => (b -> m (Either a (f b))) -> b -> m (Free f a)
free Control.Monad.Free
Unfold a free monad from a seed, monadically.
unfold :: Applicative f => (b -> Either a (f b)) -> b -> Free f a
free Control.Monad.Free.Ap
Unfold a free monad from a seed.
unfoldM :: (Applicative f, Traversable f, Monad m) => (b -> m (Either a (f b))) -> b -> m (Free f a)
free Control.Monad.Free.Ap
Unfold a free monad from a seed, monadically.