We present a particularly simple lazy lambda-calculus machine, which was introduced
twenty-five years ago. It has been, since, used and implemented by several authors, but …

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

It is well-known that many environment-based abstract machines can be seen as strategies
in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear …

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

We materialize the common understanding that calculi with explicit substitutions provide an
intermediate step between an abstract specification of substitution in the lambda-calculus …

Recent developments in the systematic construction of abstract interpreters hinted at the
possibility of a broad unification of concepts in static analysis. We deliver that unification by …

We present an abstract machine and a reduction semantics for the lambda-calculus
extended with control operators that give access to delimited continuations in the CPS …

We present an abstract machine for a strong call-by-need strategy in the lambda calculus.
The machine has been derived automatically from a higher-order evaluator that uses the …

We present a type system with subtyping for first-class delimited continuations that
generalizes Danvy and Filinski's type system for shift and reset by maintaining explicit …

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 …