Learn More
The last few years have seen a renewed interest in continuations for expressing advanced control structures in programming languages, and new models such as Abstract Continuations have been proposed(More)
We show that any monad whose unit and extension operations are expressible as purely functional terms can be embedded in a call-by-value language with “composable continuations”. As part of the(More)
There has already been considerable research on constructing modular, monad-based specifications of computational effects (state, exceptions, nondeterminism, etc.) in programming languages. We(More)
In a simply-typed, call-by-value (CBV) language with rst-class continuations , the usual CBV xpoint operator can be deened in terms of a simple, innnitely-looping iteration primitive. We rst consider(More)