Control.Effect.Fresh

Fresh effect

data Fresh m k

Constructors

Fresh (Int -> m k)

forall b. Reset (m b) (b -> m k)

Instances

Effect Fresh

Defined in Control.Effect.Fresh

Methods

handle :: (Functor f, Monad m) => f () -> (forall x. f (m x) -> n (f x)) -> Fresh m a -> Fresh n (f a)

HFunctor Fresh

Defined in Control.Effect.Fresh

Methods

fmap' :: forall (f :: Type -> Type) a b. Functor (Fresh f) => (a -> b) -> Fresh f a -> Fresh f b

hmap :: Functor m => (forall x. m x -> n x) -> Fresh m a -> Fresh n a

Functor m => Functor (Fresh m)

Defined in Control.Effect.Fresh

Methods

fmap :: (a -> b) -> Fresh m a -> Fresh m b

(<$) :: a -> Fresh m b -> Fresh m a

(Carrier sig m, Effect sig) => Carrier (Fresh :+: sig) (FreshC m)

Defined in Control.Effect.Fresh

Methods

eff :: (Fresh :+: sig) (FreshC m) a -> FreshC m a

fresh :: (Member Fresh sig, Carrier sig m) => m Int

Produce a fresh (i.e. unique) Int.

run (runFresh (replicateM n fresh)) === nub (run (runFresh (replicateM n fresh)))

resetFresh :: (Member Fresh sig, Carrier sig m) => m a -> m a

Reset the fresh counter after running a computation.

run (runFresh (resetFresh (replicateM m fresh) *> replicateM n fresh)) === run (runFresh (replicateM n fresh))

Fresh carrier

runFresh :: Functor m => FreshC m a -> m a

Run a Fresh effect counting up from 0.

run (runFresh (replicateM n fresh)) === [0..pred n]

run (runFresh (replicateM n fresh *> pure b)) === b

newtype FreshC m a

Constructors

FreshC

Fields

• runFreshC :: StateC Int m a

Instances

MonadTrans FreshC

Defined in Control.Effect.Fresh

Methods

lift :: Monad m => m a -> FreshC m a

Monad m => Monad (FreshC m)

Defined in Control.Effect.Fresh

Methods

(>>=) :: FreshC m a -> (a -> FreshC m b) -> FreshC m b

(>>) :: FreshC m a -> FreshC m b -> FreshC m b

return :: a -> FreshC m a

Functor m => Functor (FreshC m)

Defined in Control.Effect.Fresh

Methods

fmap :: (a -> b) -> FreshC m a -> FreshC m b

(<$) :: a -> FreshC m b -> FreshC m a

MonadFix m => MonadFix (FreshC m)

Defined in Control.Effect.Fresh

Methods

mfix :: (a -> FreshC m a) -> FreshC m a

MonadFail m => MonadFail (FreshC m)

Defined in Control.Effect.Fresh

Methods

fail :: String -> FreshC m a

Monad m => Applicative (FreshC m)

Defined in Control.Effect.Fresh

Methods

pure :: a -> FreshC m a

(<*>) :: FreshC m (a -> b) -> FreshC m a -> FreshC m b

liftA2 :: (a -> b -> c) -> FreshC m a -> FreshC m b -> FreshC m c

(*>) :: FreshC m a -> FreshC m b -> FreshC m b

(<*) :: FreshC m a -> FreshC m b -> FreshC m a

MonadIO m => MonadIO (FreshC m)

Defined in Control.Effect.Fresh

Methods

liftIO :: IO a -> FreshC m a

(Alternative m, Monad m) => Alternative (FreshC m)

Defined in Control.Effect.Fresh

Methods

empty :: FreshC m a

(<|>) :: FreshC m a -> FreshC m a -> FreshC m a

some :: FreshC m a -> FreshC m [a]

many :: FreshC m a -> FreshC m [a]

(Alternative m, Monad m) => MonadPlus (FreshC m)

Defined in Control.Effect.Fresh

Methods

mzero :: FreshC m a

mplus :: FreshC m a -> FreshC m a -> FreshC m a

(Carrier sig m, Effect sig) => Carrier (Fresh :+: sig) (FreshC m)

Defined in Control.Effect.Fresh

Methods

eff :: (Fresh :+: sig) (FreshC m) a -> FreshC m a

Re-exports

class (HFunctor sig, Monad m) => Carrier sig m | m -> sig

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

Minimal complete definition

eff

Instances

Carrier Pure PureC

Defined in Control.Effect.Carrier

Methods

eff :: Pure PureC a -> PureC a

(HFunctor eff, Carrier sig m, Member eff sig) => Carrier sig (InterposeC eff m)

Defined in Control.Effect.Interpose

Methods

eff :: sig (InterposeC eff m) a -> InterposeC eff m a

Monad m => Carrier (Lift m) (LiftC m)

Defined in Control.Effect.Lift

Methods

eff :: Lift m (LiftC m) a -> LiftC m a

(Carrier sig m, MonadIO m) => Carrier (Resource :+: sig) (ResourceC m)

Defined in Control.Effect.Resource

Methods

eff :: (Resource :+: sig) (ResourceC m) a -> ResourceC m a

(Carrier sig m, Effect sig) => Carrier (NonDet :+: sig) (NonDetC m)

Defined in Control.Effect.NonDet

Methods

eff :: (NonDet :+: sig) (NonDetC m) a -> NonDetC m a

(Carrier sig m, Effect sig) => Carrier (NonDet :+: sig) (OnceC m)

Defined in Control.Effect.Cull

Methods

eff :: (NonDet :+: sig) (OnceC m) a -> OnceC m a

(Carrier sig m, Effect sig) => Carrier (Fresh :+: sig) (FreshC m)

Defined in Control.Effect.Fresh

Methods

eff :: (Fresh :+: sig) (FreshC m) a -> FreshC m a

(Carrier sig m, Effect sig) => Carrier (Fail :+: sig) (FailC m)

Defined in Control.Effect.Fail

Methods

eff :: (Fail :+: sig) (FailC m) a -> FailC m a

(Carrier sig m, Effect sig) => Carrier (Cut :+: (NonDet :+: sig)) (CutC m)

Defined in Control.Effect.Cut

Methods

eff :: (Cut :+: (NonDet :+: sig)) (CutC m) a -> CutC m a

(Carrier sig m, Effect sig) => Carrier (Cull :+: (NonDet :+: sig)) (CullC m)

Defined in Control.Effect.Cull

Methods

eff :: (Cull :+: (NonDet :+: sig)) (CullC m) a -> CullC m a

(Carrier sig m, Effect sig) => Carrier (Trace :+: sig) (TraceByReturningC m)

Defined in Control.Effect.Trace

Methods

eff :: (Trace :+: sig) (TraceByReturningC m) a -> TraceByReturningC m a

Carrier sig m => Carrier (Trace :+: sig) (TraceByIgnoringC m)

Defined in Control.Effect.Trace

Methods

eff :: (Trace :+: sig) (TraceByIgnoringC m) a -> TraceByIgnoringC m a

(MonadIO m, Carrier sig m) => Carrier (Trace :+: sig) (TraceByPrintingC m)

Defined in Control.Effect.Trace

Methods

eff :: (Trace :+: sig) (TraceByPrintingC m) a -> TraceByPrintingC m a

(HFunctor eff, Carrier sig m) => Carrier (eff :+: sig) (InterpretC eff m)

Defined in Control.Effect.Interpret

Methods

eff :: (eff :+: sig) (InterpretC eff m) a -> InterpretC eff m a

(Carrier sig m, Effect sig) => Carrier (State s :+: sig) (StateC s m)

Defined in Control.Effect.State.Strict

Methods

eff :: (State s :+: sig) (StateC s m) a -> StateC s m a

(Carrier sig m, Effect sig) => Carrier (State s :+: sig) (StateC s m)

Defined in Control.Effect.State.Lazy

Methods

eff :: (State s :+: sig) (StateC s m) a -> StateC s m a

Carrier sig m => Carrier (Reader r :+: sig) (ReaderC r m)

Defined in Control.Effect.Reader

Methods

eff :: (Reader r :+: sig) (ReaderC r m) a -> ReaderC r m a

(Carrier sig m, Effect sig, RandomGen g) => Carrier (Random :+: sig) (RandomC g m)

Defined in Control.Effect.Random

Methods

eff :: (Random :+: sig) (RandomC g m) a -> RandomC g m a

(Carrier sig m, Effect sig) => Carrier (Error e :+: sig) (ErrorC e m)

Defined in Control.Effect.Error

Methods

eff :: (Error e :+: sig) (ErrorC e m) a -> ErrorC e m a

Carrier sig m => Carrier (Resumable err :+: sig) (ResumableWithC err m)

Defined in Control.Effect.Resumable

Methods

eff :: (Resumable err :+: sig) (ResumableWithC err m) a -> ResumableWithC err m a

(Carrier sig m, Effect sig) => Carrier (Resumable err :+: sig) (ResumableC err m)

Defined in Control.Effect.Resumable

Methods

eff :: (Resumable err :+: sig) (ResumableC err m) a -> ResumableC err m a

(Monoid w, Carrier sig m, Effect sig) => Carrier (Writer w :+: sig) (WriterC w m)

Defined in Control.Effect.Writer

Methods

eff :: (Writer w :+: sig) (WriterC w m) a -> WriterC w m a

(HFunctor eff, Carrier sig m, Effect sig) => Carrier (eff :+: sig) (InterpretStateC eff s m)

Defined in Control.Effect.Interpret

Methods

eff :: (eff :+: sig) (InterpretStateC eff s m) a -> InterpretStateC eff s m a

class Member (sub :: (* -> *) -> * -> *) sup

Minimal complete definition

inj, prj

Instances

Member sub sub

Defined in Control.Effect.Sum

Methods

inj :: forall (m :: Type -> Type) a. sub m a -> sub m a

prj :: forall (m :: Type -> Type) a. sub m a -> Maybe (sub m a)

Member sub sup => Member sub (sub' :+: sup)

Defined in Control.Effect.Sum

Methods

inj :: forall (m :: Type -> Type) a. sub m a -> (sub' :+: sup) m a

prj :: forall (m :: Type -> Type) a. (sub' :+: sup) m a -> Maybe (sub m a)

Member sub (sub :+: sup)

Defined in Control.Effect.Sum

Methods

inj :: forall (m :: Type -> Type) a. sub m a -> (sub :+: sup) m a

prj :: forall (m :: Type -> Type) a. (sub :+: sup) m a -> Maybe (sub m a)

run :: PureC a -> a

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