Reynolds's defunctionalization technique is a whole-program transformation from higher-
order to first-order functional programs. We study practical applications of this transformation …

We describe the implementation of first-class polymorphic delimited continuations in the
programming language Scala. We use Scala's pluggable typing architecture to implement a …

Operators for delimiting control and for capturing composable continuations litter the
landscape of theoretical programming language research. Numerous papers explain their …

We present a continuation-passing-style (CPS) transformation for some dynamic delimited-
control operators, including Felleisen's \verb|control| and \verb|prompt|, that extends a …

The strength of a dynamic language is also its weakness: run-time flexibility comes at the
cost of compile-time predictability. Many of the hallmarks of dynamic languages such as …

We present a systematic construction of environment-based abstract machines from context-
sensitive calculi of explicit substitutions, and we illustrate it with ten calculi and machines for …

An Analytical Approach to Programs as Data Objects Page 1 Olivier Danvy Doctoral thesis An
Analytical Approach to Programs as Data Objects Department of Computer Science Page 2 An …

We study the dynamic control operators for delimited continuations, Control and Prompt.
Based on recent developments on purely functional CPS translations for them, we introduce …

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 …

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in
λ-calculi by decomposing their normal forms into bisimilar subterms. Moreover, it typically …