Control.Monad.Cont.Class

Computation type:

Computations which can be interrupted and resumed.

Binding strategy:

Binding a function to a monadic value creates a new continuation which uses the function as the continuation of the monadic computation.

Useful for:

Complex control structures, error handling, and creating co-routines.

Zero and plus:

None.

Example type:

Cont r a

The Continuation monad represents computations in continuation-passing style (CPS). In continuation-passing style function result is not returned, but instead is passed to another function, received as a parameter (continuation). Computations are built up from sequences of nested continuations, terminated by a final continuation (often id) which produces the final result. Since continuations are functions which represent the future of a computation, manipulation of the continuation functions can achieve complex manipulations of the future of the computation, such as interrupting a computation in the middle, aborting a portion of a computation, restarting a computation, and interleaving execution of computations. The Continuation monad adapts CPS to the structure of a monad.

Before using the Continuation monad, be sure that you have a firm understanding of continuation-passing style and that continuations represent the best solution to your particular design problem. Many algorithms which require continuations in other languages do not require them in Haskell, due to Haskell's lazy semantics. Abuse of the Continuation monad can produce code that is impossible to understand and maintain.

Documentation

class Monad m => MonadCont (m :: Type -> Type) where

Methods

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

callCC (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 calling return is that it makes the continuation explicit, allowing more flexibility and better control (see examples in Control.Monad.Cont).

The standard idiom used with callCC is 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.

Instances

MonadCont m => MonadCont (MaybeT m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> MaybeT m b) -> MaybeT m a) -> MaybeT m a

(Monoid w, MonadCont m) => MonadCont (AccumT w m)

Since: 2.3

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> AccumT w m b) -> AccumT w m a) -> AccumT w m a

MonadCont m => MonadCont (ExceptT e m)

Since: 2.2

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> ExceptT e m b) -> ExceptT e m a) -> ExceptT e m a

MonadCont m => MonadCont (IdentityT m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> IdentityT m b) -> IdentityT m a) -> IdentityT m a

MonadCont m => MonadCont (ReaderT r m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> ReaderT r m b) -> ReaderT r m a) -> ReaderT r m a

MonadCont m => MonadCont (StateT s m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> StateT s m b) -> StateT s m a) -> StateT s m a

MonadCont m => MonadCont (StateT s m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> StateT s m b) -> StateT s m a) -> StateT s m a

(Monoid w, MonadCont m) => MonadCont (WriterT w m)

Since: 2.3

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> WriterT w m b) -> WriterT w m a) -> WriterT w m a

(Monoid w, MonadCont m) => MonadCont (WriterT w m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> WriterT w m b) -> WriterT w m a) -> WriterT w m a

(Monoid w, MonadCont m) => MonadCont (WriterT w m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> WriterT w m b) -> WriterT w m a) -> WriterT w m a

MonadCont (ContT r m)

Since: 2.3.1

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> ContT r m b) -> ContT r m a) -> ContT r m a

(Monoid w, MonadCont m) => MonadCont (RWST r w s m)

Since: 2.3

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> RWST r w s m b) -> RWST r w s m a) -> RWST r w s m a

(Monoid w, MonadCont m) => MonadCont (RWST r w s m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> RWST r w s m b) -> RWST r w s m a) -> RWST r w s m a

(Monoid w, MonadCont m) => MonadCont (RWST r w s m)

Defined in Control.Monad.Cont.Class

Methods

callCC :: ((a -> RWST r w s m b) -> RWST r w s m a) -> RWST r w s m a

label :: MonadCont m => a -> m (a -> m b, a)

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.

Since: 2.3.1

label_ :: MonadCont m => m (m a)

Simplified version of label without arguments.

Since: 2.3.1

liftCallCC :: forall (t :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) (a :: Type) (b :: Type). (MonadTrans t, Monad m, forall (m' :: Type -> Type). Monad m' => Monad (t m')) => CallCC m (t m a) b -> CallCC (t m) a b

Lift a callCC-style function through any MonadTrans.

Note

For any function f, 'liftCallCC f' satisfies the uniformity condition provided that f is quasi-algebraic. More specifically, for any g, we must have:

'join' '$' f (\exit -> 'pure' '$' g (exit '.' 'pure') = f g

callCC is quasi-algebraic; furthermore, for any quasi-algebraic f, liftCallCC f is also quasi-algebraic.

See also

• Proof of quasi-algebraic properties
• Original issue

Since: 2.3.1