There is a correspondence between classical logic and programming language calculi with
first-class continuations. With the addition of control delimiters, the continuations become …

We propose type systems that abstractly interpret small-step rather than big-step operational
semantics. We treat an expression or evaluation context as a structure in a linear logic with …

There is a correspondence between classical logic and programming language calculi with
first-class continuations. With the addition of control delimiters (prompts), the continuations …

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 …

All programs interact with their environments in one way or another: they read and write to
memory, query users for input, print out results, send data to remote servers, etc. Because …

In their purest formulation, monads are used in functional programming for two purposes:(1)
to hygienically propagate effects, and (2) to globalize the effect scope–once an effect occurs …

Abstract Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic
logic, a λ-calculus with firstclass continuations corresponds to classical logic. We study how …

The monadic formulation of exceptions forces a programming style in which the program
itself must specify a total ordering on the evaluation of exceptional computations. Moreover …

With the help of an idea of contextual modal logic, we define a logical system lambda^{refl}
that incorporates monadic reflection, and then investigate delimited continuations through …

Aspect-oriented programming systems such as AspectJ provide mechanisms for
modularizing crosscutting error-handling concerns. However, AspectJ's advice does not …