Copyright | (c) The University of Glasgow 2001 (c) Jeff Newbern 2003-2007 (c) Andriy Palamarchuk 2007 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | [email protected] |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
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.
class Monad m => MonadCont m where Source
callCC :: ((a -> m b) -> m a) -> m a Source
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 Error
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.
MonadCont m => MonadCont (MaybeT m) | |
MonadCont m => MonadCont (ListT m) | |
(Monoid w, MonadCont m) => MonadCont (WriterT w m) | |
(Monoid w, MonadCont m) => MonadCont (WriterT w m) | |
MonadCont m => MonadCont (StateT s m) | |
MonadCont m => MonadCont (StateT s m) | |
MonadCont m => MonadCont (ReaderT r m) | |
MonadCont m => MonadCont (IdentityT m) | |
MonadCont m => MonadCont (ExceptT e m) | Since: mtl-2.2 |
(Error e, MonadCont m) => MonadCont (ErrorT e m) | |
MonadCont (ContT r m) | |
(Monoid w, MonadCont m) => MonadCont (RWST r w s m) | |
(Monoid w, MonadCont m) => MonadCont (RWST r w s m) | |
type Cont r = ContT r Identity Source
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.
cont :: ((a -> r) -> r) -> Cont r a Source
Construct a continuation-passing computation from a function. (The inverse of runCont
)
:: Cont r a | continuation computation ( |
-> (a -> r) | the final continuation, which produces the final result (often |
-> r |
The result of running a CPS computation with a given final continuation. (The inverse of cont
)
mapCont :: (r -> r) -> Cont r a -> Cont r a Source
Apply a function to transform the result of a continuation-passing computation.
withCont :: ((b -> r) -> a -> r) -> Cont r a -> Cont r b Source
Apply a function to transform the continuation passed to a CPS computation.
newtype ContT (r :: k) (m :: k -> Type) a Source
The continuation monad transformer. Can be used to add continuation handling to any type constructor: the Monad
instance and most of the operations do not require m
to be a monad.
ContT
is not a functor on the category of monads, and many operations cannot be lifted through it.
ContT ((a -> m r) -> m r) |
MonadReader r' m => MonadReader r' (ContT r m) | |
MonadState s m => MonadState s (ContT r m) | |
MonadTrans (ContT r) | |
Defined in Control.Monad.Trans.Cont | |
Monad (ContT r m) | |
Functor (ContT r m) | |
MonadFail m => MonadFail (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
Applicative (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
MonadIO m => MonadIO (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
MonadCont (ContT r m) | |
runContT :: ContT r m a -> (a -> m r) -> m r Source
mapContT :: forall k m (r :: k) a. (m r -> m r) -> ContT r m a -> ContT r m a Source
Apply a function to transform the result of a continuation-passing computation. This has a more restricted type than the map
operations for other monad transformers, because ContT
does not define a functor in the category of monads.
withContT :: forall k b m (r :: k) a. ((b -> m r) -> a -> m r) -> ContT r m a -> ContT r m b Source
Apply a function to transform the continuation passed to a CPS computation.
module Control.Monad
module Control.Monad.Trans
Calculating length of a list continuation-style:
calculateLength :: [a] -> Cont r Int calculateLength l = return (length l)
Here we use calculateLength
by making it to pass its result to print
:
main = do runCont (calculateLength "123") print -- result: 3
It is possible to chain Cont
blocks with >>=
.
double :: Int -> Cont r Int double n = return (n * 2) main = do runCont (calculateLength "123" >>= double) print -- result: 6
This example gives a taste of how escape continuations work, shows a typical pattern for their usage.
-- Returns a string depending on the length of the name parameter. -- If the provided string is empty, returns an error. -- Otherwise, returns a welcome message. whatsYourName :: String -> String whatsYourName name = (`runCont` id) $ do -- 1 response <- callCC $ \exit -> do -- 2 validateName name exit -- 3 return $ "Welcome, " ++ name ++ "!" -- 4 return response -- 5 validateName name exit = do when (null name) (exit "You forgot to tell me your name!")
Here is what this example does:
Cont
block and extracts value from it with (`runCont` id)
. Here id
is the continuation, passed to the Cont
block.response
to the result of the following callCC
block, binds exit
to the continuation.name
. This approach illustrates advantage of using callCC
over return
. We pass the continuation to validateName
, and interrupt execution of the Cont
block from inside of validateName
.callCC
block. This line is not executed if validateName
fails.Cont
block.ContT
can be used to add continuation handling to other monads. Here is an example how to combine it with IO
monad:
import Control.Monad.Cont import System.IO main = do hSetBuffering stdout NoBuffering runContT (callCC askString) reportResult askString :: (String -> ContT () IO String) -> ContT () IO String askString next = do liftIO $ putStrLn "Please enter a string" s <- liftIO $ getLine next s reportResult :: String -> IO () reportResult s = do putStrLn ("You entered: " ++ s)
Action askString
requests user to enter a string, and passes it to the continuation. askString
takes as a parameter a continuation taking a string parameter, and returning IO ()
. Compare its signature to runContT
definition.
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/8.8.3/docs/html/libraries/mtl-2.2.2/Control-Monad-Cont.html