Proof Diagrams for Multiplicative Linear Logic

Matteo Acclavio

The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof in sequent calculus.

In this paper we give an interpretation of proof nets in the syntax of string diagrams. Even though we lose standard proof equivalence, our construction allows to define a framework where soundness and well-typeness of a diagram can be verified in linear time.

In Iliano Cervesato and Maribel Fernández: Proceedings Fourth International Workshop on Linearity (LINEARITY 2016), Porto, Portugal, 25 June 2016, Electronic Proceedings in Theoretical Computer Science 238, pp. 11–23.
Published: 17th January 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.238.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org