Introduces a recursive binding to the continuation.
Due to the use of callCC, calling the continuation will interrupt execution
of the current block creating an effect similar to goto/setjmp in C.
Modulererebase-1.21.2Haskell2010
Control.Monad.Cont
- 2 types
- 1 class
- 10 values
- Packagererebase-1.21.2
- Exports13
- LanguageHaskell2010
- LicenceMIT
- SourceClass.hs
Continuation monad.
Cont r a is a CPS ("continuation-passing style") computation that produces an
intermediate result of type a within a CPS computation whose final result type
is r.
The return function simply creates a continuation which passes the value on.
The >>= operator adds the bound function into the continuation chain.
Simplified version of label without arguments.
Construct a continuation-passing computation from a function. (The inverse of runCont)
runCont The result of running a CPS computation with a given final continuation. (The inverse of cont)
Methods
callCC :: ((a -> m b) -> m a) -> m acallCC(call-with-current-continuation) calls a function with the current continuation as its argument. Provides an escape continuation mechanism for use with Continuation monads. Escape continuations allow to abort the current computation and return a value immediately. They achieve a similar effect to throwError and catchError within an Except monad. Advantage of this function over callingreturnis that it makes the continuation explicit, allowing more flexibility and better control (see examples in Control.Monad.Cont).The standard idiom used with
callCCis to provide a lambda-expression to name the continuation. Then calling the named continuation anywhere within its scope will escape from the computation, even if it is many layers deep within nested computations.
Instances22MonadCont, …
MonadCont m => MonadCont (Free m)Defined in free-5.2 · Control.Monad.FreeMonadCont m => MonadCont (Free m)Defined in free-5.2 · Control.Monad.Free.ApMonadCont m => MonadCont (F m)Defined in free-5.2 · Control.Monad.Free.ChurchMonadCont m => MonadCont (IterT m)Defined in free-5.2 · Control.Monad.Trans.IterMonadCont m => MonadCont (MaybeT m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont m => MonadCont (FT f m)Defined in free-5.2 · Control.Monad.Trans.Free.ChurchMonadCont m => MonadCont (ExceptT e m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont m => MonadCont (IdentityT m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont m => MonadCont (ReaderT r m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont m => MonadCont (StateT s m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont m => MonadCont (StateT s m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Representable g, MonadCont m) => MonadCont (StateT g m)Defined in adjunctions-4.4.3 · Control.Monad.Representable.State(Applicative f, MonadCont m) => MonadCont (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Functor f, MonadCont m) => MonadCont (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free(Monoid w, MonadCont m) => MonadCont (AccumT w m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (WriterT w m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (WriterT w m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (WriterT w m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadCont (ContT r m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class(Monoid w, MonadCont m) => MonadCont (RWST r w s m)Defined in mtl-2.3.1 · Control.Monad.Cont.Class
Instances24MonadAccum, MonadReader, MonadState, MonadSelect, MonadBase, MonadFree, …
MonadAccum w m => MonadAccum w (ContT r m)Defined in mtl-2.3.1 · Control.Monad.AccumThe continuation can see, and interact with, the accumulated value.
MonadReader r' m => MonadReader r' (ContT r m)Defined in mtl-2.3.1 · Control.Monad.Reader.ClassMonadState s m => MonadState s (ContT r m)Defined in mtl-2.3.1 · Control.Monad.State.ClassMonadSelect r' m => MonadSelect r' (ContT r m)Defined in mtl-2.3.1 · Control.Monad.SelectThe continuation describes a way of choosing a 'search' or 'ranking' strategy for
r, based on a 'ranking' usingr', given anya. We then get a 'search' strategy forr.MonadBase b m => MonadBase b (ContT r m)Defined in transformers-base-0.4.6 · Control.Monad.Base(Functor f, MonadFree f m) => MonadFree f (ContT r m)Defined in free-5.2 · Control.Monad.Free.ClassMonadTrans (ContT r)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContBindTrans (ContT r)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.TransMonad (ContT r m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContFunctor (ContT r m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContMonadFail m => MonadFail (ContT r m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContApplicative (ContT r m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContMonadIO m => MonadIO (ContT r m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.ContMonadCont (ContT r m)Defined in mtl-2.3.1 · Control.Monad.Cont.ClassMonadThrow m => MonadThrow (ContT r m)Defined in exceptions-0.10.9 · Control.Monad.CatchPrimMonad m => PrimMonad (ContT r m)Defined in primitive-0.9.1.0 · Control.Monad.PrimitiveApply (ContT r m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.ClassBind (ContT r m)Defined in semigroupoids-6.0.1 · Data.Functor.Bind.ClassInvariant (ContT r m)Defined in invariant-0.6.4 · Data.Functor.Invariantfrom the
transformerspackageSelective (ContT r m)Defined in selective-0.7.0.1 · Control.SelectivePointed (ContT r m)Defined in pointed-5.0.4 · Data.PointedGeneric (ContT r m a)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Conttype Rep (ContT r m a) = D1 ('MetaDataDefined in transformers-0.6.1.1 · Control.Monad.Trans.Cont"ContT"
"Control.Monad.Trans.Cont"
"transformers-0.6.1.1-a11a"
'True) (C1 ('MetaCons"ContT"
'PrefixI 'True) (S1 ('MetaSel ('Just"runContT"
) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ((a -> m r) -> m r))))type PrimState (ContT r m) = PrimState mDefined in primitive-0.9.1.0 · Control.Monad.Primitive