This dissertation presents a study of functional programming languages with first-class
delimited continuations. We focus mainly on theoretical and practical aspects of Danvy and …

We put a preexisting definitional abstract machine for dynamic delimited continuations in
defunctionalized form, and we present the consequences of this adjustment. We first prove …

Delimited continuations are more expressive than traditional abortive continuations and they
apparently require a framework beyond traditional continuation-passing style (CPS). We …

We present the first formalization of implementation strategies for first-class continuations.
The formalization hinges on abstract machines for continuation-passing style (CPS) …

We show that breadth-first traversal exploits the difference between the static delimited-
control operator shift (alias S) and the dynamic delimited-control operator control (alias F) …

The shift and reset operators, proposed by Danvy and Filinski, are powerful control
primitives for capturing delimited continuations. Delimited continuation is a similar concept …

We give a framework for delimited control with multiple prompts, in the style of Parigot's λμ-
calculus, through a series of incremental extensions by starting with the pure λ-calculus …

We define a partial continuation as the difference of two continuations. We exhibit, in a
single framework, several design choices and their impact on semantics. The ability of …

Delimited continuations are the mother of all monads! So goes the slogan inspired by
Filinski's 1994 paper, which showed that delimited continuations can implement any …

The delimited-control operator shift0 has been formally shown to capture the operational
semantics of deep handlers for algebraic effects. Its CPS translation generates λ-terms in …