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 …

Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology,
we introduce an untyped structural λ-calculus, called λj, which combines action at a distance …

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

We present a ty** system with non-idempotent intersection types, ty** a term syntax
covering three different calculi: the pure λ-calculus, the calculus with explicit substitutions λ …

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 …

This paper gives a detailed account of the relationship between (a variant of) the call-by-
value lambda calculus and linear logic proof nets. The presentation is carefully tuned in …

Many different systems with explicit substitutions have been proposed to implement a large
class of higher-order languages. Motivations and challenges that guided the development of …

We define two non-idempotent intersection type systems for the linear substitution calculus,
a calculus with partial substitutions acting at a distance that is a computational interpretation …

This thesis embarks on a comprehensive exploration of formal computational models that
underlie typed programming languages. We focus on programming calculi, both functional …

An explicit-sharing lambda-calculus is presented, based on a Curry-Howard-style
interpretation of the deep inference proof formalism. Duplication of subterms during …