Proof Nets and the Linear Substitution Calculus

Beniamino Accattoli (1)

1 PARSIFAL - Proof search and reasoning with logic specifications

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 particular proof nets have an explicit notion of sharing-the exponentials-and a micro-step operational semantics, while the λ-calculus has no sharing and a small-step operational semantics. Here we show that the linear substitution calculus, a simple refinement of the λ-calculus with sharing, is isomorphic to proof nets at the operational level. Nonetheless, two different terms with sharing can still have the same proof nets representation-a further result is the characterisation of the equality induced by proof nets over terms with sharing. Finally, such a detailed analysis of the relationship between terms and proof nets, suggests a new, abstract notion of proof net, based on rewriting considerations and not necessarily of a graphical nature.

Domaines: Logique en informatique [cs.LO]

Beniamino Accattoli. Proof Nets and the Linear Substitution Calculus. 15th International Colloquium on Theoretical Aspects of Computing (ICTAC 2018), Oct 2018, Stellenbosch, South Africa. ⟨hal-01967532⟩