A linear algorithm for MLL proof net correctness and sequentialization
From MaRDI portal
Publication:534705
DOI10.1016/j.tcs.2010.12.021zbMath1222.03067MaRDI QIDQ534705
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.021
68Q25: Analysis of algorithms and problem complexity
03F07: Structure of proofs
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Unnamed Item, Unnamed Item, Proof nets for multiplicative cyclic linear logic and Lambek calculus, Learning Lambek Grammars from Proof Frames, A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
Cites Work
- Unnamed Item
- Linear logic
- A linear-time algorithm for a special case of disjoint set union
- The structure of multiplicatives
- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
- An Efficient Unification Algorithm
- Efficiency of a Good But Not Linear Set Union Algorithm
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- Fast verification of MLL proof nets via IMLL
- Parsing MELL proof nets