Backpropagation is a classic automatic differentiation algorithm computing the gradient of
functions specified by a certain class of simple, first-order programs, called computational …

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 …

Standardization is a fundamental notion for connecting programming languages and
rewriting calculi. Since both programming languages and calculi rely on substitution for …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

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 …

The lambda-calculus is a widely accepted computational model of higher-order functional
programs, yet there is not any direct and universally accepted cost model for it. As a …

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 …

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 …