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 the first operational account of call by need that connects syntactic theory and
implementation practice. Syntactic theory: the storeless operational semantics using syntax …

Strong call by need is a reduction strategy for computing strong normal forms in the lambda
calculus, where terms are fully normalized inside the bodies of lambda abstractions and …

Starting from the standard call-by-need reduction for the λ-calculus that is common to Ariola,
Felleisen, Maraist, Odersky, and Wadler, we inter-derive a series of hygienic semantic …

The functional correspondence is a manual derivation technique transforming higher-order
evaluators into the semantically equivalent abstract machines. The transformation consists …

In order to solve a long-standing problem with list fusion, a new compiler transformation,"
Call Arity" is developed and implemented in the Haskell compiler GHC. It is formally proven …

Skeletal semantics is a framework to describe semantics of programming languages. We
propose an automatic generation of a certified OCaml interpreter for any language written in …

We introduce a semantic toolbox for Ltac, the tactic language of the popular Coq proof
assistant. We present three formats of operational semantics, each of which has its use in …

(Coinductive) natural semantics is presented as a unifying framework for the verification of
total correctness of compilers in Coq (with the feature that a verified compiler can be …

Abstract machines are both theoretical models used to study language properties and
practical models of language implementations. As with all language implementations …