The semantics of the untyped (call-by-name) lambda-calculus is a well developed field built
around the concept of solvable terms, which are elegantly characterized in many different …

This paper introduces the exponential substitution calculus (ESC), a new presentation of cut
elimination for IMELL, based on proof terms and building on the idea that exponentials can …

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 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 …

This paper studies useful sharing, which is a sophisticated optimization for lambda-calculi, in
the context of call-by-need evaluation in presence of open terms. Useful sharing turns out to …

Can the λ-calculus be considered a reasonable computational model? Can we use it for
measuring the time and space consumption of algorithms? While the literature contains …

This paper provides foundations for strong (that is, possibly under abstraction) call-by-value
evaluation for the λ-calculus. Recently, Accattoli et al. proposed a form of call-by-value …

A fundamental issue in the $\lambda $-calculus is to find appropriate notions for
meaningfulness. Inspired by well-known results for the call-by-name $\lambda $-calculus …

Abstract machines for strong evaluation of the λ-calculus enter into arguments and have a
set of transitions for backtracking out of an evaluated argument. We study a new abstract …

Normal form bisimilarities are a natural form of program equivalence resting on open terms,
first introduced by Sangiorgi in call-by-name. The literature contains a normal form …