| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Polysemy.Internal
Synopsis
- newtype Semantic r a = Semantic {
- runSemantic :: forall m. Monad m => (forall x. Union r (Semantic r) x -> m x) -> m a
- type Member e r = Member' e r
- send :: Member e r => e (Semantic r) a -> Semantic r a
- sendM :: Member (Lift m) r => m a -> Semantic r a
- run :: Semantic '[] a -> a
- runM :: Monad m => Semantic '[Lift m] a -> m a
- raise :: forall e r a. Semantic r a -> Semantic (e ': r) a
- newtype Lift m (z :: * -> *) a where
- usingSemantic :: Monad m => (forall x. Union r (Semantic r) x -> m x) -> Semantic r a -> m a
- liftSemantic :: Union r (Semantic r) a -> Semantic r a
- hoistSemantic :: (forall x. Union r (Semantic r) x -> Union r' (Semantic r') x) -> Semantic r a -> Semantic r' a
- (.@) :: Monad m => (forall x. Semantic r x -> m x) -> (forall y. (forall x. Semantic r x -> m x) -> Semantic (e ': r) y -> Semantic r y) -> Semantic (e ': r) z -> m z
- (.@@) :: Monad m => (forall x. Semantic r x -> m x) -> (forall y. (forall x. Semantic r x -> m x) -> Semantic (e ': r) y -> Semantic r (f y)) -> Semantic (e ': r) z -> m (f z)
Documentation
The Semantic monad handles computations of arbitrary extensible effects.
A value of type Semantic r describes a program with the capabilities of
r. For best results, r should always be kept polymorphic, but you can
add capabilities via the Member constraint.
The value of the Semantic monad is that it allows you to write programs
against a set of effects without a predefined meaning, and provide that
meaning later. For example, unlike with mtl, you can decide to interpret an
Error effect tradtionally as an Either, or instead
significantly faster as an IO Exception. These
interpretations (and others that you might add) may be used interchangably
without needing to write any newtypes or Monad instances. The only
change needed to swap interpretations is to change a call from
runError to runErrorInIO.
The effect stack r can contain arbitrary other monads inside of it. These
monads are lifted into effects via the Lift effect. Monadic values can be
lifted into a Semantic via sendM.
A Semantic can be interpreted as a pure value (via run) or as any
traditional Monad (via runM). Each effect E comes equipped with some
interpreters of the form:
runE ::Semantic(E ': r) a ->Semanticr a
which is responsible for removing the effect E from the effect stack. It
is the order in which you call the interpreters that determines the
monomorphic representation of the r parameter.
After all of your effects are handled, you'll be left with either
a or a Semantic '[] a value, which can be
consumed respectively by Semantic '[ Lift m ] arun and runM.
Examples
As an example of keeping r polymorphic, we can consider the type
Member(StateString) r =>Semanticr ()
to be a program with access to
get::Semanticr Stringput:: String ->Semanticr ()
methods.
By also adding a
Member(ErrorBool) r
constraint on r, we gain access to the
throw:: Bool ->Semanticr acatch::Semanticr a -> (Bool ->Semanticr a) ->Semanticr a
functions as well.
In this sense, a constraint is
analogous to mtl's Member (State s) r and should
be thought of as such. However, unlike mtl, a MonadState s mSemantic monad may have
an arbitrary number of the same effect.
For example, we can write a Semantic program which can output either
Ints or Bools:
foo :: (Member(OutputInt) r ,Member(OutputBool) r ) =>Semanticr () foo = dooutput@Int 5outputTrue
Notice that we must use -XTypeApplications to specify that we'd like to
use the (Output Int) effect.
Constructors
| Semantic | |
Fields
| |
Instances
| Monad (Semantic f) Source # | |
| Functor (Semantic f) Source # | |
| Member Fixpoint r => MonadFix (Semantic r) Source # | |
Defined in Polysemy.Internal | |
| Applicative (Semantic f) Source # | |
Defined in Polysemy.Internal | |
| Member (Lift IO) r => MonadIO (Semantic r) Source # | This instance will only lift |
Defined in Polysemy.Internal | |
| Member NonDet r => Alternative (Semantic r) Source # | |
type Member e r = Member' e r Source #
A proof that the effect e is available somewhere inside of the effect
stack r.
send :: Member e r => e (Semantic r) a -> Semantic r a Source #
Lift an effect into a Semantic. This is used primarily via
makeSemantic to implement smart constructors.
newtype Lift m (z :: * -> *) a where Source #
An effect which allows a regular Monad m into the Semantic
ecosystem. Monadic actions in m can be lifted into Semantic via
sendM.
For example, you can use this effect to lift IO actions directly into
Semantic:
sendM(putStrLn "hello") ::Member(LiftIO) r =>Semanticr ()
That being said, you lose out on a significant amount of the benefits of
Semantic by using sendM directly in application code; doing so
will tie your application code directly to the underlying monad, and prevent
you from interpreting it differently. For best results, only use Lift in
your effect interpreters.
Consider using trace and runTraceIO as
a substitute for using putStrLn directly.
usingSemantic :: Monad m => (forall x. Union r (Semantic r) x -> m x) -> Semantic r a -> m a Source #
Like runSemantic but flipped for better ergonomics sometimes.
hoistSemantic :: (forall x. Union r (Semantic r) x -> Union r' (Semantic r') x) -> Semantic r a -> Semantic r' a Source #
Arguments
| :: Monad m | |
| => (forall x. Semantic r x -> m x) | The lowering function, likely |
| -> (forall y. (forall x. Semantic r x -> m x) -> Semantic (e ': r) y -> Semantic r y) | |
| -> Semantic (e ': r) z | |
| -> m z |
Some interpreters need to be able to lower down to the base monad (often
IO) in order to function properly --- some good examples of this are
runErrorInIO and runResource.
However, these interpreters don't compose particularly nicely; for example,
to run runResource, you must write:
runM . runErrorInIO runM
Notice that runM is duplicated in two places here. The situation gets
exponentially worse the more intepreters you have that need to run in this
pattern.
Instead, .@ performs the composition we'd like. The above can be written as
(runM .@ runErrorInIO)
The parentheses here are important; without them you'll run into operator precedence errors.