Parsing MELL proof nets

DOI10.1016/S0304-3975(99)00299-6zbMath0974.68077MaRDI QIDQ5940925

Andrea Masini, Stefano Guerrini

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

passingrewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

Unnamed Item ⋮ Unnamed Item ⋮ Proof nets for classical logic ⋮ Correctness of linear logic proof structures is NL-complete ⋮ A linear algorithm for MLL proof net correctness and sequentialization ⋮ Unnamed Item ⋮ Proof diagrams for multiplicative linear logic: syntax and semantics ⋮ Proof nets, garbage, and computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• The structure of multiplicatives
• Constant-only multiplicative linear logic is NP-complete
• Coherence for sharing proof-nets
• Sequent reconstruction in LLM -- A sweepline proof

This page was built for publication: Parsing MELL proof nets