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

This document illustrates how functional implementations of formal semantics (structural
operational semantics, reduction semantics, small-step and big-step abstract machines …

We document an operational method to construct reduction-free normalization functions.
Starting from a reduction-based normalization function from a reduction semantics, ie, the …

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 …

Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant,
we investigate the constructive versions of some completeness theorems. We start by …

We present a systematic construction of a reduction-free normalization function. Starting
from a reduction-based normalization function, ie, the transitive closure of a one-step …

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) …

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 …

We present a new abstract machine for Abadi and Cardelli's untyped non-imperative
calculus of objects. This abstract machine mechanically corresponds to both the reduction …