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 …

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

We study a simple form of standardization, here called factorization, for explicit substitutions
calculi, ie lambda-calculi where beta-reduction is decomposed in various rules. These …

We enhance the calculus of string diagrams for monoidal categories with hierarchical
features in order to capture closed monoidal (and cartesian closed) structure. Using this new …

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 …

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 …

We document an operational method to construct reduction-free normalization functions.
Starting from a reduction-based normalization function from a reduction semantics, ie, the …

Inspired by a recent graphical formalism for lambda-calculus based on linear logic
technology, we introduce an untyped structural lambda-calculus, called lambda j, which …

We present a systematic construction of a reduction-free normalization function. Starting
from a reduction-based normalization function, ie, the transitive closure of a one-step …