2016/06/30 by Matteo Acclavio
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.238.2
published as EPTCS 238, 2017, pp. 11-23 · In Proceedings LINEARITY 2016, arXiv:1701.04522
arxiv created 2017/01/18 · arxiv updated 2017/01/19
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.