Control.Monad.Trans.Hefty

The data structure of hefty trees.

Documentation

newtype HeftyT h m a

A hefty monad transformer.

Constructors

HeftyT

Fields

• runHeftyT :: m (FreeF (h (HeftyT h m)) a (HeftyT h m a))

Instances

MonadTrans (HeftyT h)

Defined in Control.Monad.Trans.Hefty

Methods

lift :: Monad m => m a -> HeftyT h m a

(Monad m, Functor (h (HeftyT h m))) => Applicative (HeftyT h m)

Defined in Control.Monad.Trans.Hefty

Methods

pure :: a -> HeftyT h m a

(<*>) :: HeftyT h m (a -> b) -> HeftyT h m a -> HeftyT h m b

liftA2 :: (a -> b -> c) -> HeftyT h m a -> HeftyT h m b -> HeftyT h m c

(*>) :: HeftyT h m a -> HeftyT h m b -> HeftyT h m b

(<*) :: HeftyT h m a -> HeftyT h m b -> HeftyT h m a

(Functor m, Functor (h (HeftyT h m))) => Functor (HeftyT h m)

Defined in Control.Monad.Trans.Hefty

Methods

fmap :: (a -> b) -> HeftyT h m a -> HeftyT h m b

(<$) :: a -> HeftyT h m b -> HeftyT h m a

(Monad m, Functor (h (HeftyT h m))) => Monad (HeftyT h m)

Defined in Control.Monad.Trans.Hefty

Methods

(>>=) :: HeftyT h m a -> (a -> HeftyT h m b) -> HeftyT h m b

(>>) :: HeftyT h m a -> HeftyT h m b -> HeftyT h m b

return :: a -> HeftyT h m a

liftHefty :: Functor m => m a -> HeftyT h m a

Lift a computation to a hefty monad.

Note that this is less constrained than MonadTrans's lift (this one only requires a Functor for underlying monad).

type Hefty h = HeftyT h Identity

A hefty monad.

hefty :: FreeF (h (Hefty h)) a (Hefty h a) -> Hefty h a

runHefty :: Hefty h a -> FreeF (h (Hefty h)) a (Hefty h a)