Fast verification of MLL proof nets via IMLL

We consider the following decision problems:ProofNet: Is a given multiplicative linear logic (MLL) proof structure a proof net?EssNet: Is a given essential net (of an intuitionistic MLL sequent) correct?In this article we show how to obtain linear-time algorithms for EssNet. As a corollary, by showing that ProofNet is linear-time reducible to EssNet (by the Trip Translation), we obtain a linear-time algorithm for ProofNet.We show further that it is possible to optimize the verification so that each node of the input structure is visited at most once. Finally, we present linear-time algorithms for sequentializing proof nets and essential nets, that is, for finding derivations of the underlying sequents.

[1]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[2]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Mikkel Thorup,et al.  Dominators in Linear Time , 1999, SIAM J. Comput..

[5]  Stefano Guerrini,et al.  Correctness of multiplicative proof nets is linear , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[6]  Vincent Danos.  La Logique Linéaire appliquée à l'étude de divers processus de normalisation (principalement du Lambda-calcul) , 1990 .

[7]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[8]  Haim Kaplan,et al.  A new, simpler linear-time dominators algorithm , 1998, TOPL.

[9]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[10]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Andrzej S. Murawski,et al.  Exhausting strategies, joker games and full completeness for IMLL with Unit , 2003, Theor. Comput. Sci..

[13]  Michael L. Fredman,et al.  Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Andrzej S. Murawski,et al.  Dominator trees and fast verification of proof nets , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[15]  Dov Harel,et al.  A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.

[16]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[17]  François Lamarche.  From Proof Nets to Games , 1996, Electron. Notes Theor. Comput. Sci..