Coherence for sharing proof-nets

DOI10.1016/S0304-3975(01)00162-1zbMath1019.03040OpenAlexW1982545996MaRDI QIDQ1398472

Andrea Masini, Stefano Guerrini, Simone Martini

Publication date: 29 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00162-1

zbMATH Keywords

linear logiccut-eliminationproof-netslambda-calculus optimal reductionssharing graphs

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version), Coherence for sharing proof-nets, Light logics and optimal reduction: completeness and complexity, Parsing MELL proof nets, Jumping Boxes, Is the Optimal Implementation Inefficient? Elementarily Not, Proof nets, garbage, and computations

Cites Work

• Linear logic
• Constructivism in mathematics. An introduction. Volume I
• Interaction systems II: The practice of optimal reductions
• Coherence for sharing proof-nets
• A general theory of sharing graphs
• Proof nets, garbage, and computations
• Parallel beta reduction is not elementary recursive
• Optimality and inefficiency
• Interaction Systems I: The theory of optimal reductions
• (Optimal) duplication is not elementary recursive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item