Control.Eff.NdetEff

Another implementation of nondeterministic choice effect

Documentation

data NdetEff a where

A different implementation, more directly mapping to MonadPlus interface

Constructors

MZero :: NdetEff a

MPlus :: NdetEff Bool

Instances

(MonadBase m m, SetMember (Lift :: (Type -> Type) -> Type -> Type) (Lift m) r, MonadBaseControl m (Eff r)) => MonadBaseControl m (Eff (NdetEff ': r))

Defined in Control.Eff.NdetEff

Associated Types

type StM (Eff (NdetEff ': r)) a :: Type

Methods

liftBaseWith :: (RunInBase (Eff (NdetEff ': r)) m -> m a) -> Eff (NdetEff ': r) a

restoreM :: StM (Eff (NdetEff ': r)) a -> Eff (NdetEff ': r) a

type StM (Eff (NdetEff ': r)) a

Defined in Control.Eff.NdetEff

type StM (Eff (NdetEff ': r)) a = StM (Eff r) [a]

makeChoiceA0 :: 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

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

A different implementation, more involved but faster and taking much less (100 times) less memory. The benefit of the effect framework is that we can have many interpreters.

makeChoiceLst :: Eff (NdetEff ': r) a -> Eff r [a]

Same as makeChoiceA, except it has the type hardcoded. Required for MonadBaseControl instance.

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

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

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