Modulefused-effects-1.1.2.7Haskell2010

Control.Carrier.Interpret

Provides an InterpretC carrier capable of interpreting an arbitrary effect using a passed-in higher order function to interpret that effect. This is suitable for prototyping new effects quickly.

3 types
2 classes
3 values

Packagefused-effects-1.1.2.7
Exports8
LanguageHaskell2010
LicenceBSD-3-Clause
SourceInterpret.hs

Interpret carrier

5 declarations

valuerunInterpret

:: forall (ctx :: Type -> Type) (n :: Type -> Type) x. Functor ctx => Handler ctx n m -> eff n x -> ctx () -> m (ctx x)
-> forall s. Reifies s (Interpreter eff m) => InterpretC s eff m a
-> m a

Interpret an effect using a higher-order function.

Note that due to the higher-rank type, you have to use either $ or explicit application when applying this interpreter. That is, you will need to write runInterpret f (runInterpret g myPrgram) or runInterpret f $ runInterpret g $ myProgram. If you try and write runInterpret f . runInterpret g, you will unfortunately get a rather scary type error!

valuerunInterpretState

:: forall (ctx :: Type -> Type) (n :: Type -> Type) x. Functor ctx => Handler ctx n (StateC s m) -> eff n x -> s -> ctx () -> m (s, ctx x)
-> s
-> forall t. Reifies t (Interpreter eff (StateC s m)) => InterpretC t eff (StateC s m) a
-> m (s, a)

Interpret an effect using a higher-order function with some state variable.

newtypenewtype InterpretC s (sig :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) a

Constructors

InterpretC
- runInterpretC :: m a

Instances11MonadTrans, Algebra, Monad, Functor, MonadFix, MonadFail, …

MonadTrans (InterpretC s sig)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
(Reifies s (Interpreter eff m), Algebra sig m) => Algebra (eff :+: sig) (InterpretC s eff m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
Monad m => Monad (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
Functor m => Functor (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
MonadFix m => MonadFix (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
MonadFail m => MonadFail (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
Applicative m => Applicative (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
Alternative m => Alternative (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
MonadPlus m => MonadPlus (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
MonadIO m => MonadIO (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
MonadUnliftIO m => MonadUnliftIO (InterpretC s sig m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret

classclass Reifies s a | s -> a where

newtypenewtype Interpreter (sig :: (Type -> Type) -> Type -> Type) (m :: Type -> Type)

An Interpreter is a function that interprets effects described by sig into the carrier monad m.

Re-exports

3 declarations

classclass Monad m => Algebra (sig :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) | m -> sig where

The class of carriers (results) for algebras (effect handlers) over signatures (effects), whose actions are given by the alg method.

Instances53Algebra, …

Algebra Choose NonEmptyDefined in fused-effects-1.1.2.7 · Control.Algebra
Algebra Empty MaybeDefined in fused-effects-1.1.2.7 · Control.Algebra
Algebra NonDet []Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra sig (Choosing m)Defined in fused-effects-1.1.2.7 · Control.Effect.Choose
Algebra sig m => Algebra sig (Ap m)Defined in fused-effects-1.1.2.7 · Control.Algebra
This instance permits effectful actions to be lifted into the Ap monad given a monoidal return type, which can provide clarity when chaining calls to mappend.
```
mappend <$> act1 <*> (mappend <$> act2 <*> act3)
```
is equivalent to
```
getAp (act1 <> act2 <> act3)
```
Algebra sig m => Algebra sig (Alt m)Defined in fused-effects-1.1.2.7 · Control.Algebra
This instance permits effectful actions to be lifted into the Alt monad, which eases the invocation of repeated alternation with <|>:
```
a <|> b <|> c <|> d
```
is equivalent to
```
getAlt (mconcat [a, b, c, d])
```
Algebra sig m => Algebra sig (IdentityT m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra (Lift Identity) IdentityDefined in fused-effects-1.1.2.7 · Control.Algebra
Algebra (Lift IO) IODefined in fused-effects-1.1.2.7 · Control.Algebra
Algebra (Error e) (Either e)Defined in fused-effects-1.1.2.7 · Control.Algebra
Monad m => Algebra (Lift m) (LiftC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Lift
Monoid w => Algebra (Writer w) (Tuple2 w)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra (Reader r) ((->) r)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (Choose :+: sig) (ChooseC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Choose.Church
Algebra sig m => Algebra (Cull :+: (NonDet :+: sig)) (CullC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Cull.Church
Algebra sig m => Algebra (Cut :+: (NonDet :+: sig)) (CutC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Cut.Church
Algebra sig m => Algebra (Empty :+: sig) (EmptyC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Empty.Church
Algebra sig m => Algebra (Empty :+: sig) (EmptyC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Empty.Maybe
Algebra sig m => Algebra (Empty :+: sig) (MaybeT m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (Fail :+: sig) (FailC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Fail.Either
Algebra sig m => Algebra (Fresh :+: sig) (FreshC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Fresh.Church
Algebra sig m => Algebra (Fresh :+: sig) (FreshC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Fresh.Strict
Algebra sig m => Algebra (NonDet :+: sig) (NonDetC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.NonDet.Church
Algebra sig m => Algebra (Trace :+: sig) (TraceC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Trace.Ignoring
Algebra sig m => Algebra (Trace :+: sig) (TraceC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Trace.Returning
(MonadIO m, Algebra sig m) => Algebra (Trace :+: sig) (TraceC m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Trace.Printing
Algebra sig m => Algebra (Error e :+: sig) (ErrorC e m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Error.Church
Algebra sig m => Algebra (Error e :+: sig) (ErrorC e m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Error.Either
Algebra sig m => Algebra (Error e :+: sig) (ExceptT e m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (Reader r :+: sig) (ReaderC r m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Reader
Algebra sig m => Algebra (Reader r :+: sig) (ReaderT r m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (State s :+: sig) (StateC s m)Defined in fused-effects-1.1.2.7 · Control.Carrier.State.Church
Algebra sig m => Algebra (State s :+: sig) (StateC s m)Defined in fused-effects-1.1.2.7 · Control.Carrier.State.Lazy
Algebra sig m => Algebra (State s :+: sig) (StateC s m)Defined in fused-effects-1.1.2.7 · Control.Carrier.State.Strict
Algebra sig m => Algebra (State s :+: sig) (StateT s m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (State s :+: sig) (StateT s m)Defined in fused-effects-1.1.2.7 · Control.Algebra
Algebra sig m => Algebra (Throw e :+: sig) (ThrowC e m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Throw.Either
(Algebra sig m, Monoid w) => Algebra (Accum w :+: sig) (AccumC w m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Accum.Church
(Algebra sig m, Monoid w) => Algebra (Accum w :+: sig) (AccumC w m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Accum.Strict
(Algebra sig m, Monoid w) => Algebra (Accum w :+: sig) (AccumT w m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Monoid w) => Algebra (Writer w :+: sig) (WriterC w m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Writer.Church
(Algebra sig m, Monoid w) => Algebra (Writer w :+: sig) (WriterT w m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Monoid w) => Algebra (Writer w :+: sig) (WriterT w m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Monoid w) => Algebra (Writer w :+: sig) (WriterT w m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Semigroup w, MonadIO m) => Algebra (Accum w :+: sig) (AccumC w m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Accum.IORef
(Monoid w, Algebra sig m) => Algebra (Writer w :+: sig) (WriterC w m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Writer.Strict
(MonadIO m, Algebra sig m) => Algebra (State s :+: sig) (StateC s m)Defined in fused-effects-1.1.2.7 · Control.Carrier.State.IORef
(Reifies s (Interpreter eff m), Algebra sig m) => Algebra (eff :+: sig) (InterpretC s eff m)Defined in fused-effects-1.1.2.7 · Control.Carrier.Interpret
Algebra (eff :+: sig) (sub m) => Algebra (Labelled label eff :+: sig) (Labelled label sub m)Defined in fused-effects-1.1.2.7 · Control.Effect.Labelled
(Algebra sig m, Monoid w) => Algebra (Reader r :+: (Writer w :+: (State s :+: sig))) (RWST r w s m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Monoid w) => Algebra (Reader r :+: (Writer w :+: (State s :+: sig))) (RWST r w s m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(Algebra sig m, Monoid w) => Algebra (Reader r :+: (Writer w :+: (State s :+: sig))) (RWST r w s m)Defined in fused-effects-1.1.2.7 · Control.Algebra
(LabelledMember label sub sig, Algebra sig m) => Algebra (sub :+: sig) (UnderLabel label sub m)Defined in fused-effects-1.1.2.7 · Control.Effect.Labelled

type

type Has (eff :: (Type -> Type) -> Type -> Type) (sig :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) = (Members eff sig, Algebra sig m)

m is a carrier for sig containing eff.

Note that if eff is a sum, it will be decomposed into multiple Member constraints. While this technically allows one to combine multiple unrelated effects into a single Has constraint, doing so has two significant drawbacks:

Due to a problem with recursive type families, this can lead to significantly slower compiles.
It defeats ghc’s warnings for redundant constraints, and thus can lead to a proliferation of redundant constraints as code is changed.

valuerun :: Identity a -> a

Run an action exhausted of effects to produce its final result value.