It is well-known that many environment-based abstract machines can be seen as strategies
in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear …

Multi types–aka non-idempotent intersection types–have been used. to obtain quantitative
bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the …

We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …

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 …

The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and
closed terms, that are natural hypotheses in the study of programming languages. To model …

Accattoli, Dal Lago, and Vanoni have recently proved that the space used by the Space
KAM, a variant of the Krivine abstract machine, is a reasonable space cost model for the λ …

Evaluating higher-order functional programs through abstract machines inspired by the
geometry of the interaction is known to induce space efficiencies, the price being time …

Abstract machines for functional languages rely on the notion of environment, a data
structure storing the previously encountered and delayed beta-redexes. This paper provides …

In CSL-LICS 2014, Accattoli and Dal Lago [1] showed that there is an implementation of the
ordinary (ie strong, pure, call-by-name) λ-calculus into models like RAM machines which is …

Since the very beginning of the theory of linear logic it is known how to represent the λ λ-
calculus as linear logic proof nets. The two systems however have different granularities, in …