Control.Effect.Type.Unravel

Documentation

data Unravel p :: Effect where

A primitive effect which allows you to break a computation into layers. This is the primitive effect underlying Intercept and InterceptCont.

Note: ThreadsEff instances are not allowed to assume that p is a functor.

Unravel is typically used as a primitive effect. If you define a Carrier that relies on a novel non-trivial monad transformer t, then you need to make a ThreadsEff t (Unravel p) instance (if possible).

The following threading constraints accept Unravel:

• ReaderThreads
• ErrorThreads
• NonDetThreads
• SteppedThreads
• ContThreads

Constructors

Unravel :: p a -> (m a -> a) -> m a -> Unravel p m a

Instances

ThreadsEff ListT (Unravel p)

Defined in Control.Monad.Trans.List.Church

Methods

threadEff :: Monad m => (forall x. Unravel p m x -> m x) -> Unravel p (ListT m) a -> ListT m a

(FirstOrder e, Carrier m, Threaders '[SteppedThreads] m p) => PrimHandler InterceptH (Unravel (InterceptB e)) (SteppedC e m)

Defined in Control.Effect.Internal.Intercept

Methods

effPrimHandler :: EffPrimHandler (Unravel (InterceptB e)) (SteppedC e m)

ThreadsEff (ExceptT e) (Unravel p)

Defined in Control.Effect.Type.Unravel

Methods

threadEff :: Monad m => (forall x. Unravel p m x -> m x) -> Unravel p (ExceptT e m) a -> ExceptT e m a

ThreadsEff (ReaderT i) (Unravel p)

Defined in Control.Effect.Type.Unravel

Methods

threadEff :: Monad m => (forall x. Unravel p m x -> m x) -> Unravel p (ReaderT i m) a -> ReaderT i m a

ThreadsEff (FreeT f) (Unravel p)

Defined in Control.Monad.Trans.Free.Church.Alternate

Methods

threadEff :: Monad m => (forall x. Unravel p m x -> m x) -> Unravel p (FreeT f m) a -> FreeT f m a