The standard implementation technique for lazy functional languages is call-by-need, which
ensures that an argument to a function in any given call is evaluated at most once. A …

We consider the relation of the dual calculus of Wadler (2003) to the λμ-calculus of Parigot
(1992). We give translations from the λμ-calculus into the dual calculus and back again. The …

We study beta-reduction in a linear lambda-calculus derived from Abramsky's linear
combinatory algebras. Reductions are classified depending on whether the redex is in the …

We present the Maude sufficient completeness tool, which explicitly supports sufficient
completeness reasoning for partial conditional specifications having sorts and subsorts and …

Closure conversion, an essential step in compiling functional programs, is traditionally
presented as a global transformation from a language with higher-order functions to one …

The polymorphic environment calculus is a polymorphic lambda calculus which enables us
to treat environments as first-class citizens. In the calculus, environments are formalized as …

Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed
point recursion as an expressive semantic metalanguage. We study its expressive power …

In lazy functional programming modularity is often achieved by using intermediate data
structures to combine separate parts of a program. Each intermediate data structure is …

Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a
clear operational semantics given by Launchbury. However, modern non-strict functional …

The application of natural semantic specifications of lazy evaluation to areas such as usage
analysis, formal profiling and abstract machine construction has shown it to be a useful …