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 …

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 …

Landin's SECD machine was the first abstract machine for applicative expressions, ie,
functional programs. Landin's J operator was the first control operator for functional …

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 …

We derive two big-step abstract machines, a natural semantics, and the valuation function of
a denotational semantics based on the small-step abstract machine for Core Scheme …

Landin's J operator was the first control operator for functional languages, and was specified
with an extension of the SECD machine. Through a series of meaning-preserving …