Calculi with explicit substitutions (ES) are widely used in different areas of computer science.
Complex systems with ES were developed these last 15 years to capture the good …

We present a simple term calculus with an explicit control of erasure and duplication of
substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment …

We define pure intuitionistic differential proof nets, extending Ehrhard and Regnier's
differential interaction nets with the exponential box of Linear Logic. Normalization of the …

Proof nets and explicit substitutions Page 1 Math. Struct. in Comp. Science (2003), vol. 13, pp.
409–450. c 2003 Cambridge University Press DOI: 10.1017/S0960129502003791 Printed in …

We present a simple term language with explicit operators for erasure, duplication and
substitution enjoying a sound and complete correspondence with the intuitionistic fragment …

We refine the simulation technique introduced in [10] to show strong normalization of λ-
calculi with explicit substitutions via termination of cut elimination in proof nets [13]. We first …

We study the confluence of Ehrhard and Regnier's differential nets with exponential
promotion, in a pure setting. Confluence fails with promotion and codereliction in absence of …

A team of sociologists decides to conduct an experiment. Inside an empty room they put a
gas stove and a table. On the table they put a lighter and a saucepan with some water in it …

At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard
correspondence provides proof-terms with computational features and equational theories …

We prove the conservation theorem for differential nets–the graph-theoretical syntax of the
differential extension of Linear Logic (Ehrhard and Regnier's DiLL). The conservation …