Whether the number of β-steps in the λ-calculus can be taken as a reasonable time cost
model (that is, polynomially related to the one of Turing machines) is a delicate problem …

Effect handlers are a modern and increasingly popular approach to structuring
computational effects in functional programming languages. However, while their traditional …

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

We present a generic framework for the specification and reasoning about reduction
strategies in the lambda calculus, representable as sets of term decompositions. It is …

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

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 present a call-by-need λ-calculus that enables strong reduction (that is, reduction inside
the body of abstractions) and guarantees that arguments are only evaluated if needed and …