Control.Freer

A type class to abstract away the encoding details of the Freer carriers.

Documentation

class (forall ins. c (f ins)) => Freer c f | f -> c where

A type class to abstract away the encoding details of the Freer carrier.

Minimal complete definition

liftIns, (interpretF | retract, transformF)

Methods

liftIns :: ins a -> f ins a

Lift a instruction into a Freer carrier.

interpretF :: c m => (ins ~> m) -> f ins a -> m a

retract :: c m => f m a -> m a

transformF :: (ins ~> ins') -> f ins a -> f ins' a

Translate instructions embedded in a Freer carrier.

reinterpretF :: (ins ~> f ins) -> f ins a -> f ins a

Instances

Freer Applicative Ap

Defined in Control.Freer

Methods

liftIns :: forall ins (a :: k). ins a -> Ap ins a

interpretF :: forall m (ins :: k -> Type) (a :: k). Applicative m => (ins ~> m) -> Ap ins a -> m a

retract :: forall m (a :: k). Applicative m => Ap m a -> m a

transformF :: forall (ins :: k -> Type) (ins' :: k -> Type) (a :: k). (ins ~> ins') -> Ap ins a -> Ap ins' a

reinterpretF :: forall (ins :: k -> Type) (a :: k). (ins ~> Ap ins) -> Ap ins a -> Ap ins a

Freer Functor Coyoneda

Defined in Control.Freer

Methods

liftIns :: forall ins (a :: k). ins a -> Coyoneda ins a

interpretF :: forall m (ins :: k -> Type) (a :: k). Functor m => (ins ~> m) -> Coyoneda ins a -> m a

retract :: forall m (a :: k). Functor m => Coyoneda m a -> m a

transformF :: forall (ins :: k -> Type) (ins' :: k -> Type) (a :: k). (ins ~> ins') -> Coyoneda ins a -> Coyoneda ins' a

reinterpretF :: forall (ins :: k -> Type) (a :: k). (ins ~> Coyoneda ins) -> Coyoneda ins a -> Coyoneda ins a

Freer Monad FreerTree

Defined in Control.Monad.Trans.Freer.Tree

Methods

liftIns :: forall ins (a :: k). ins a -> FreerTree ins a

interpretF :: forall m (ins :: k -> Type) (a :: k). Monad m => (ins ~> m) -> FreerTree ins a -> m a

retract :: forall m (a :: k). Monad m => FreerTree m a -> m a

transformF :: forall (ins :: k -> Type) (ins' :: k -> Type) (a :: k). (ins ~> ins') -> FreerTree ins a -> FreerTree ins' a

reinterpretF :: forall (ins :: k -> Type) (a :: k). (ins ~> FreerTree ins) -> FreerTree ins a -> FreerTree ins a