free package:control-monad-free

free :: MonadFree f m => m a -> m (Either a (f (m a)))
control-monad-free Control.Monad.Free
module Control.Monad.Free
control-monad-free
data Free f a
control-monad-free Control.Monad.Free
newtype FreeT f m a
control-monad-free Control.Monad.Free
FreeT :: m (Either a (f (FreeT f m a))) -> FreeT f m a
control-monad-free Control.Monad.Free
package control-monad-free
Uses
Free monads and monad transformers This package provides datatypes to construct Free monads, Free monad transformers, and useful instances. In addition it provides the constructs to avoid quadratic complexity of left associative bind, as explained in:
  • Janis Voigtlander, Asymptotic Improvement of Computations over Free Monads, MPC'08
class (Functor f, Monad m) => MonadFree f m
control-monad-free Control.Monad.Free
This type class generalizes over encodings of Free Monads.
evalFree :: (a -> b) -> (f (Free f a) -> b) -> Free f a -> b
control-monad-free Control.Monad.Free
foldFree :: Functor f => (a -> b) -> (f b -> b) -> Free f a -> b
control-monad-free Control.Monad.Free
foldFreeA :: (Traversable f, Applicative m) => (a -> m b) -> m (f b -> b) -> Free f a -> m b
control-monad-free Control.Monad.Free
foldFreeM :: (Traversable f, Monad m) => (a -> m b) -> (f b -> m b) -> Free f a -> m b
control-monad-free Control.Monad.Free
foldFreeT :: (Traversable f, Monad m) => (a -> m b) -> (f b -> m b) -> FreeT f m a -> m b
control-monad-free Control.Monad.Free
foldFreeT' :: (Traversable f, Monad m) => (a -> b) -> (f b -> b) -> FreeT f m a -> m b
control-monad-free Control.Monad.Free
liftFree :: (Functor f, Monad m) => (a -> Free f b) -> (a -> FreeT f m b)
control-monad-free Control.Monad.Free
mapFree :: (Functor f, Functor g) => (f (Free g a) -> g (Free g a)) -> Free f a -> Free g a
control-monad-free Control.Monad.Free
mapFreeA :: (Traversable f, Functor g, Applicative m) => m (f (Free g a) -> g (Free g a)) -> Free f a -> m (Free g a)
control-monad-free Control.Monad.Free
mapFreeM :: (Traversable f, Functor g, Monad m) => (f (Free g a) -> m (g (Free g a))) -> Free f a -> m (Free g a)
control-monad-free Control.Monad.Free
mapFreeM' :: (Functor f, Traversable g, Monad m) => (forall a . f a -> m (g a)) -> Free f a -> m (Free g a)
control-monad-free Control.Monad.Free
mapFreeT :: (Functor f, Functor m) => (forall a . m a -> m' a) -> FreeT f m a -> FreeT f m' a
control-monad-free Control.Monad.Free
unFreeT :: FreeT f m a -> m (Either a (f (FreeT f m a)))
control-monad-free Control.Monad.Free
zipFree :: (Traversable f, Eq (f ()), MonadFail m) => (Free f a -> Free f b -> m (Free f c)) -> Free f a -> Free f b -> m (Free f c)
control-monad-free Control.Monad.Free.Zip
zipFree_ :: (Traversable f, Eq (f ()), MonadFail m) => (Free f a -> Free f b -> m ()) -> Free f a -> Free f b -> m ()
control-monad-free Control.Monad.Free.Zip