Safe Haskell  None 

Language  Haskell2010 
Synopsis
 data Sem r a
 type Member e r = Member' e r
 type family Members es r :: Constraint where ...
 class MemberNoError end r => LastMember end r  r > end
 run :: Sem '[] a > a
 runM :: Monad m => Sem '[Lift m] a > m a
 newtype Lift m (z :: Type > Type) a where
 sendM :: Member (Lift m) r => m a > Sem r a
 raise :: forall e r a. Sem r a > Sem (e ': r) a
 makeSem :: Name > Q [Dec]
 makeSem_ :: Name > Q [Dec]
 interpret :: FirstOrder m0 e "interpret" => (forall x m. e m x > Sem r x) > Sem (e ': r) a > Sem r a
 intercept :: (Member e r, FirstOrder m0 e "intercept") => (forall x m. e m x > Sem r x) > Sem r a > Sem r a
 reinterpret :: forall e1 e2 m0 r a. FirstOrder m0 e1 "reinterpret" => (forall m x. e1 m x > Sem (e2 ': r) x) > Sem (e1 ': r) a > Sem (e2 ': r) a
 reinterpret2 :: forall e1 e2 e3 m0 r a. FirstOrder m0 e1 "reinterpret2" => (forall m x. e1 m x > Sem (e2 ': (e3 ': r)) x) > Sem (e1 ': r) a > Sem (e2 ': (e3 ': r)) a
 reinterpret3 :: forall e1 e2 e3 e4 m0 r a. FirstOrder m0 e1 "reinterpret3" => (forall m x. e1 m x > Sem (e2 ': (e3 ': (e4 ': r))) x) > Sem (e1 ': r) a > Sem (e2 ': (e3 ': (e4 ': r))) a
 interpretH :: (forall x m. e m x > Tactical e m r x) > Sem (e ': r) a > Sem r a
 interceptH :: Member e r => (forall x m. e m x > Tactical e m r x) > Sem r a > Sem r a
 reinterpretH :: forall e1 e2 r a. (forall m x. e1 m x > Tactical e1 m (e2 ': r) x) > Sem (e1 ': r) a > Sem (e2 ': r) a
 reinterpret2H :: forall e1 e2 e3 r a. (forall m x. e1 m x > Tactical e1 m (e2 ': (e3 ': r)) x) > Sem (e1 ': r) a > Sem (e2 ': (e3 ': r)) a
 reinterpret3H :: forall e1 e2 e3 e4 r a. (forall m x. e1 m x > Tactical e1 m (e2 ': (e3 ': (e4 ': r))) x) > Sem (e1 ': r) a > Sem (e2 ': (e3 ': (e4 ': r))) a
 withLowerToIO :: LastMember (Lift IO) r => ((forall x. Sem r x > IO x) > IO () > IO a) > Sem r a
 type Effect = (Type > Type) > Type > Type
 type EffectRow = [Effect]
 (.@) :: Monad m => (forall x. Sem r x > m x) > (forall y. (forall x. Sem r x > m x) > Sem (e ': r) y > Sem r y) > Sem (e ': r) z > m z
 (.@@) :: Monad m => (forall x. Sem r x > m x) > (forall y. (forall x. Sem r x > m x) > Sem (e ': r) y > Sem r (f y)) > Sem (e ': r) z > m (f z)
 type Tactical e m r x = forall f. Functor f => Sem (WithTactics e f m r) (f x)
 type WithTactics e f m r = Tactics f m (e ': r) ': r
 getInitialStateT :: forall f m r e. Sem (WithTactics e f m r) (f ())
 pureT :: a > Tactical e m r a
 runT :: m a > Sem (WithTactics e f m r) (Sem (e ': r) (f a))
 bindT :: (a > m b) > Sem (WithTactics e f m r) (f a > Sem (e ': r) (f b))
 getInspectorT :: forall e f m r. Sem (WithTactics e f m r) (Inspector f)
 newtype Inspector f = Inspector {}
Core Types
The Sem
monad handles computations of arbitrary extensible effects.
A value of type Sem 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 Sem
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 Sem
via sendM
.
A Sem
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 ::Sem
(E ': r) a >Sem
r 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 Sem
'[] a
value, which can be
consumed respectively by Sem
'[ Lift
m ] arun
and runM
.
Examples
As an example of keeping r
polymorphic, we can consider the type
Member
(State
String) r =>Sem
r ()
to be a program with access to
get
::Sem
r Stringput
:: String >Sem
r ()
methods.
By also adding a
Member
(Error
Bool) r
constraint on r
, we gain access to the
throw
:: Bool >Sem
r acatch
::Sem
r a > (Bool >Sem
r a) >Sem
r 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 mSem
monad may have
an arbitrary number of the same effect.
For example, we can write a Sem
program which can output either
Int
s or Bool
s:
foo :: (Member
(Output
Int) r ,Member
(Output
Bool) r ) =>Sem
r () foo = dooutput
@Int 5output
True
Notice that we must use XTypeApplications
to specify that we'd like to
use the (Output
Int
) effect.
Since: 0.1.2.0
Instances
Monad (Sem f) Source #  
Functor (Sem f) Source #  
Member Fixpoint r => MonadFix (Sem r) Source #  
Defined in Polysemy.Internal  
Member NonDet r => MonadFail (Sem r) Source #  Since: 0.2.1.0 
Defined in Polysemy.Internal  
Applicative (Sem f) Source #  
Member (Lift IO) r => MonadIO (Sem r) Source #  This instance will only lift 
Defined in Polysemy.Internal  
Member NonDet r => Alternative (Sem r) Source #  
Member NonDet r => MonadPlus (Sem r) Source #  Since: 0.2.1.0 
type Member e r = Member' e r Source #
A proof that the effect e
is available somewhere inside of the effect
stack r
.
type family Members es r :: Constraint where ... Source #
Makes constraints of functions that use multiple effects shorter by
translating single list of effects into multiple Member
constraints:
foo ::Members
'[Output
Int ,Output
Bool ,State
String ] r =>Sem
r ()
translates into:
foo :: (Member
(Output
Int) r ,Member
(Output
Bool) r ,Member
(State
String) r ) =>Sem
r ()
Since: 0.1.2.0
class MemberNoError end r => LastMember end r  r > end Source #
A proof that end
is the last effect in the row.
Since: 0.5.0.0
Instances
LastMember end (end ': ([] :: [Effect])) Source #  
Defined in Polysemy.Internal.Union  
(LastMember end r, MemberNoError end (eff ': r)) => LastMember end (eff ': r) Source #  
Defined in Polysemy.Internal.Union 
Running Sem
Interoperating With Other Monads
newtype Lift m (z :: Type > Type) a where Source #
An effect which allows a regular Monad
m
into the Sem
ecosystem. Monadic actions in m
can be lifted into Sem
via
sendM
.
For example, you can use this effect to lift IO
actions directly into
Sem
:
sendM
(putStrLn "hello") ::Member
(Lift
IO) r =>Sem
r ()
That being said, you lose out on a significant amount of the benefits of
Sem
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.
Lifting
Creating New Effects
Effects should be defined as a GADT (enable XGADTs
), with kind (*
> *) > * > *
. Every primitive action in the effect should be its
own constructor of the type. For example, we can model an effect which
interacts with a tty console as follows:
data Console m a where WriteLine :: String > Console m () ReadLine :: Console m String
Notice that the a
parameter gets instataniated at the /desired return
type/ of the actions. Writing a line returns a '()', but reading one
returns String
.
By enabling XTemplateHaskell
, we can use the makeSem
function
to generate smart constructors for the actions. These smart constructors
can be invoked directly inside of the Sem
monad.
makeSem ''Console
results in the following definitions:
writeLine ::Member
Console r => String >Sem
r () readLine ::Member
Console r =>Sem
r String
Effects which don't make use of the m
parameter are known as
"firstorder effects."
HigherOrder Effects
Every effect has access to the m
parameter, which corresponds to the
Sem
monad it's used in. Using this parameter, we're capable of
writing effects which themselves contain subcomputations.
For example, the definition of Error
is
dataError
e m a whereThrow
:: e >Error
e m aCatch
:: m a > (e > m a) >Error
e m a
where Catch
is an action that can run an exception
handler if its first argument calls throw
.
makeSem ''Error
throw
::Member
(Error
e) r => e >Sem
r acatch
::Member
(Error
e) r =>Sem
r a > (e >Sem
r a) >Sem
r a
As you see, in the smart constructors, the m
parameter has become
.Sem
r
makeSem :: Name > Q [Dec] Source #
If T
is a GADT representing an effect algebra, as described in the
module documentation for Polysemy, $(
automatically
generates a smart constructor for every data constructor of makeSem
''T)T
. This also
works for data family instances. Names of smart constructors are created by
changing first letter to lowercase or removing prefix :
in case of
operators. Fixity declaration is preserved for both normal names and
operators.
Since: 0.1.2.0
makeSem_ :: Name > Q [Dec] Source #
Like makeSem
, but does not provide type signatures and fixities. This
can be used to attach Haddock comments to individual arguments for each
generated function.
data Output o m a where Output :: o > Output o m () makeSem_ ''Output   Output the value @o@. output :: forall o r . Member (Output o) r => o  ^ Value to output. > Sem r ()  ^ No result.
Because of limitations in Template Haskell, signatures have to follow some rules to work properly:
makeSem_
must be used before the explicit type signatures signatures have to specify argument of
Sem
representing union of effects asr
(e.g.
)Sem
r ()  all arguments in effect's type constructor have to follow naming scheme from effect's declaration:
data Foo e m a where FooC1 :: Foo x m () FooC2 :: Foo (Maybe x) m ()
should have e
in type signature of fooC1
:
fooC1 :: forall e r. Member (Foo e) r => Sem r ()
but x
in signature of fooC2
:
fooC2 :: forall x r. Member (Foo (Maybe x)) r => Sem r ()
 all effect's type variables and
r
have to be explicitly quantified usingforall
(order is not important)
These restrictions may be removed in the future, depending on changes to the compiler.
Since: 0.1.2.0
Combinators for Interpreting FirstOrder Effects
:: FirstOrder m0 e "interpret"  
=> (forall x m. e m x > Sem r x)  A natural transformation from the handled effect to other effects
already in 
> Sem (e ': r) a  
> Sem r a 
The simplest way to produce an effect handler. Interprets an effect e
by
transforming it into other effects inside of r
.
:: (Member e r, FirstOrder m0 e "intercept")  
=> (forall x m. e m x > Sem r x)  A natural transformation from the handled effect to other effects
already in 
> Sem r a  
> Sem r a 
Like interpret
, but instead of handling the effect, allows responding to
the effect while leaving it unhandled. This allows you, for example, to
intercept other effects and insert logic around them.
:: FirstOrder m0 e1 "reinterpret"  
=> (forall m x. e1 m x > Sem (e2 ': r) x)  A natural transformation from the handled effect to the new effect. 
> Sem (e1 ': r) a  
> Sem (e2 ': r) a 
Like interpret
, but instead of removing the effect e
, reencodes it in
some new effect f
. This function will fuse when followed by
runState
, meaning it's free to reinterpret
in terms of
the State
effect and immediately run it.
:: FirstOrder m0 e1 "reinterpret2"  
=> (forall m x. e1 m x > Sem (e2 ': (e3 ': r)) x)  A natural transformation from the handled effect to the new effects. 
> Sem (e1 ': r) a  
> Sem (e2 ': (e3 ': r)) a 
Like reinterpret
, but introduces two intermediary effects.
:: FirstOrder m0 e1 "reinterpret3"  
=> (forall m x. e1 m x > Sem (e2 ': (e3 ': (e4 ': r))) x)  A natural transformation from the handled effect to the new effects. 
> Sem (e1 ': r) a  
> Sem (e2 ': (e3 ': (e4 ': r))) a 
Like reinterpret
, but introduces three intermediary effects.
Combinators for Interpreting HigherOrder Effects
:: Member e r  
=> (forall x m. e m x > Tactical e m r x)  A natural transformation from the handled effect to other effects
already in 
> Sem r a  Unlike 
> Sem r a 
Like interceptH
, but for higherorder effects.
See the notes on Tactical
for how to use this function.
:: (forall m x. e1 m x > Tactical e1 m (e2 ': r) x)  A natural transformation from the handled effect to the new effect. 
> Sem (e1 ': r) a  
> Sem (e2 ': r) a 
Like reinterpret
, but for higherorder effects.
See the notes on Tactical
for how to use this function.
:: (forall m x. e1 m x > Tactical e1 m (e2 ': (e3 ': r)) x)  A natural transformation from the handled effect to the new effects. 
> Sem (e1 ': r) a  
> Sem (e2 ': (e3 ': r)) a 
Like reinterpret2
, but for higherorder effects.
See the notes on Tactical
for how to use this function.
:: (forall m x. e1 m x > Tactical e1 m (e2 ': (e3 ': (e4 ': r))) x)  A natural transformation from the handled effect to the new effects. 
> Sem (e1 ': r) a  
> Sem (e2 ': (e3 ': (e4 ': r))) a 
Like reinterpret3
, but for higherorder effects.
See the notes on Tactical
for how to use this function.
Combinators for Interpreting Directly to IO
:: LastMember (Lift IO) r  
=> ((forall x. Sem r x > IO x) > IO () > IO a)  A lambda that takes the lowering function, and a finalizing 
> Sem r a 
Run an effect stack all the way down to IO
by running it in a new
thread, and temporarily turning the current thread into an event poll.
This function creates a thread, and so should be compiled with threaded
.
Since: 0.5.0.0
Kind Synonyms
Composing IObased Interpreters
:: Monad m  
=> (forall x. Sem r x > m x)  The lowering function, likely 
> (forall y. (forall x. Sem r x > m x) > Sem (e ': r) y > Sem r y)  
> Sem (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 runResourceInIO
.
However, these interpreters don't compose particularly nicely; for example,
to run runResourceInIO
, 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.
Warning: This combinator will duplicate work that is intended to be
just for initialization. This can result in rather surprising behavior. For
a version of .@
that won't duplicate work, see the .@!
operator in
polysemyzoo.
:: Monad m  
=> (forall x. Sem r x > m x)  The lowering function, likely 
> (forall y. (forall x. Sem r x > m x) > Sem (e ': r) y > Sem r (f y))  
> Sem (e ': r) z  
> m (f z) 
Like .@
, but for interpreters which change the resulting type  eg.
runErrorInIO
.
Tactics
Higherorder effects need to explicitly thread other effects' state through themselves. Tactics are a domainspecific language for describing exactly how this threading should take place.
The first computation to be run should use runT
, and subsequent
computations in the same environment should use bindT
. Any
firstorder constructors which appear in a higherorder context may use
pureT
to satisfy the typechecker.
type Tactical e m r x = forall f. Functor f => Sem (WithTactics e f m r) (f x) Source #
Tactical
is an environment in which you're capable of explicitly
threading higherorder effect states. This is provided by the (internal)
effect Tactics
, which is capable of rewriting monadic actions so they run
in the correct stateful environment.
Inside a Tactical
, you're capable of running pureT
, runT
and bindT
which are the main tools for rewriting monadic stateful environments.
For example, consider trying to write an interpreter for
Resource
, whose effect is defined as:
dataResource
m a whereBracket
:: m a > (a > m ()) > (a > m b) >Resource
m b
Here we have an m a
which clearly needs to be run first, and then
subsequently call the a > m ()
and a > m b
arguments. In a Tactical
environment, we can write the threading code thusly:
Bracket
alloc dealloc use > do alloc' <runT
alloc dealloc' <bindT
dealloc use' <bindT
use
where
alloc' ::Sem
(Resource
': r) (f a1) dealloc' :: f a1 >Sem
(Resource
': r) (f ()) use' :: f a1 >Sem
(Resource
': r) (f x)
The f
type here is existential and corresponds to "whatever
state the other effects want to keep track of." f
is always
a Functor
.
alloc'
, dealloc'
and use'
are now in a form that can be
easily consumed by your interpreter. At this point, simply bind
them in the desired order and continue on your merry way.
We can see from the types of dealloc'
and use'
that since they both
consume a f a1
, they must run in the same stateful environment. This
means, for illustration, any put
s run inside the use
block will not be visible inside of the dealloc
block.
Power users may explicitly use getInitialStateT
and bindT
to construct
whatever data flow they'd like; although this is usually unnecessary.
type WithTactics e f m r = Tactics f m (e ': r) ': r Source #
getInitialStateT :: forall f m r e. Sem (WithTactics e f m r) (f ()) Source #
:: m a  The monadic action to lift. This is usually a parameter in your effect. 
> Sem (WithTactics e f m r) (Sem (e ': r) (f a)) 
:: (a > m b)  The monadic continuation to lift. This is usually a parameter in your effect. Continuations lifted via 
> Sem (WithTactics e f m r) (f a > Sem (e ': r) (f b)) 
getInspectorT :: forall e f m r. Sem (WithTactics e f m r) (Inspector f) Source #
Get a natural transformation capable of potentially inspecting values
inside of f
. Binding the result of getInspectorT
produces a function that
can sometimes peek inside values returned by bindT
.
This is often useful for running callback functions that are not managed by polysemy code.
Example
We can use the result of getInspectT
to "undo" pureT
(or any of the other
Tactical
functions):
ins <getInspectorT
fa <pureT
"hello" fb <pureT
True let a =inspect
ins fa  Just "hello" b =inspect
ins fb  Just True
We
A container for inspect
. See the documentation for getInspectorT
.
Inspector  
