We bridge the gap between functional evaluators and abstract machines for the λ-calculus,
using closure conversion, transformation into continuation-passing style, and …

FreshML extends ML with elegant and practical constructs for declaring and manipulating
syntactical data involving statically scoped binding operations. User-declared FreshML …

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 …

First-class control operators provide programmers with an expressive and efficient means for
manipulating control through reification of the current control state as a first-class object …

Landin's SECD machine was the first abstract machine for the λ-calculus viewed as a
programming language. Both theoretically as a model of computation and practically as an …

Just-in-time (JIT) compilation of running programs provides more optimization opportunities
than offline compilation. Modern JIT compilers, such as those in virtual machines like …

We extend our correspondence between evaluators and abstract machines from the pure
setting of the λ-calculus to the impure setting of the computational λ-calculus. We show how …

We present an efficient implementation of the full-reducing call-by-value strategy for the pure
λ-calculus in the form of an abstract machine. The presented machine has been …

We present an abstract machine that implements a full-reducing (aka strong) call-by-value
strategy for pure λ λ-calculus. It is derived using Danvy et al.'s functional correspondence …