A linear algorithm for MLL proof net correctness and sequentialization

The paper presents in full detail the first linear algorithm given in the literature (Guerrini (1999) 6) implementing proof structure correctness for multiplicative linear logic without units. The algorithm is essentially a reformulation of the Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.

[1]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[2]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

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

[4]  Mitsuhiro Okada,et al.  A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics , 2001, J. Symb. Log..

[5]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[6]  Virgile Mogbil,et al.  Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete , 2007, CSL.

[7]  Andrzej S. Murawski,et al.  Fast verification of MLL proof nets via IMLL , 2006, TOCL.

[8]  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).

[9]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[10]  Andrea Masini,et al.  Parsing MELL proof nets , 2001, Theor. Comput. Sci..

[11]  François Lamarche,et al.  Proof Nets for Intuitionistic Linear Logic: Essential Nets , 2008 .

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

[13]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[14]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[15]  Y. Lafont.  From proof-nets to interaction nets , 1995 .

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

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

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