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 …

We present a generalization of the refocusing procedure that provides a generic method for
deriving an abstract machine from a specification of a reduction semantics satisfying simple …

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 …

We present a generic design of abstract machines for nondeterministic programming
languages, such as process calculi or concurrent lambda calculi, that provides a simple way …

Big-step semantics for languages with abrupt termination and/or divergence suffer from a
serious duplication problem, addressed by the novel 'pretty-big-step'style presented by …

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 …

From Mathematics to Abstract Machine Page 1 J. Chapman and PB Levy (Eds.): Fourth
Workshop on Mathematically Structured Functional Programming (MSFP 2012). EPTCS 76 …

We propose the first steps in the development of a tool to automate the translation of Redex
models into a (hopefully) semantically equivalent model in Coq, and to provide tactics to …

This paper explores the semantics of the meta-notation used in the style of operational
semantics introduced by Felleisen and Hieb. Specifically, it defines a formal system that …