A linear algorithm for MLL proof net correctness and sequentialization
From MaRDI portal
Publication:534705
DOI10.1016/J.TCS.2010.12.021zbMath1222.03067OpenAlexW2011228482MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (5)
Unnamed Item ⋮ Proof nets for multiplicative cyclic linear logic and Lambek calculus ⋮ Learning Lambek Grammars from Proof Frames ⋮ Unnamed Item ⋮ 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
This page was built for publication: A linear algorithm for MLL proof net correctness and sequentialization