Control.Monad.Eff.NdetEff

Documentation

data NdetEff a

makeChoiceA :: Alternative f => Eff (NdetEff ': r) a -> Eff r (f a)

An interpreter The following is very simple, but leaks a lot of memory The cause probably is mapping every failure to empty It takes then a lot of timne and space to store those empty

msplit :: Member NdetEff r => Eff r a -> Eff r (Maybe (a, Eff r a))

unmsplit :: Member NdetEff r => Maybe (a, Eff r a) -> Eff r a

called reflect in the LogicT paper

ifte :: Member NdetEff r => Eff r a -> (a -> Eff r b) -> Eff r b -> Eff r b

Other committed choice primitives can be implemented in terms of msplit The following implementations are directly from the LogicT paper

once :: Member NdetEff r => Eff r a -> Eff r a

Orphan instances

Member NdetEff r => Alternative (Eff r)

Methods

empty :: Eff r a

(<|>) :: Eff r a -> Eff r a -> Eff r a

some :: Eff r a -> Eff r [a]

many :: Eff r a -> Eff r [a]

Member NdetEff r => MonadPlus (Eff r)

Methods

mzero :: Eff r a

mplus :: Eff r a -> Eff r a -> Eff r a