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

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 …

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 …

The lambda calculus since more than half a century is a model and foundation of functional
programming languages. However, lambda expressions can be evaluated with different …

Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped
proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with …

Slot and van Emde Boas Invariance Thesis states that a time (respectively, space) cost
model is reasonable for a computational model C if there are mutual simulations between …

We study the equivalence between eval-readback and eval-apply big-step evaluators in the
general setting of the pure lambda calculus. We study 'one-step'equivalence (same strategy) …

Non-deterministic abstract machine (NDAM) is a recent implementation model for
programming languages where one must choose among several redexes at each reduction …