Control.Monad.Codensity

Documentation

newtype Codensity m a

Constructors

Codensity

Fields

runCodensity :: forall b. (a -> m b) -> m b

Instances

MonadTrans Codensity

(Monad (Codensity m), Functor f, MonadFree f m) => MonadFree f (Codensity m)

(Monad (Codensity m), MonadReader r m) => MonadState r (Codensity m)

Monad (Codensity f)

Functor (Codensity k)

(Monad (Codensity v), MonadPlus v) => MonadPlus (Codensity v)

Functor (Codensity f) => Applicative (Codensity f)

(Applicative (Codensity v), Alternative v) => Alternative (Codensity v)

(Monad (Codensity m), MonadIO m) => MonadIO (Codensity m)

(Alt (Codensity v), Plus v) => Plus (Codensity v)

(Functor (Codensity v), Alt v) => Alt (Codensity v)

Functor (Codensity f) => Apply (Codensity f)

MonadSpec (Codensity m)

lowerCodensity :: Monad m => Codensity m a -> m a

codensityToAdjunction :: Adjunction f g => Codensity g a -> g (f a)

adjunctionToCodensity :: Adjunction f g => g (f a) -> Codensity g a

improve :: Functor f => (forall m. MonadFree f m => m a) -> Free f a

Right associate all binds in a computation that generates a free monad This can improve the asymptotic efficiency of the result, while preserving semantics.