Proof nets, garbage, and computations

DOI10.1016/S0304-3975(00)00094-3zbMath0956.68024MaRDI QIDQ1589650

Simone Martini, Andrea Masini, Stefano Guerrini

Publication date: 12 December 2000

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

zbMATH Keywords

linear logiccut-eliminationproof netstyped lambda-calculussharing graphs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (5)

Coherence for sharing proof-nets ⋮ A proof-theoretic investigation of a logic of positions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multi-focused cut elimination

Cites Work

• Linear logic
• Computational interpretations of linear logic
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• Interaction systems II: The practice of optimal reductions
• Coherence for sharing proof-nets
• A general theory of sharing graphs
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Sequent reconstruction in LLM -- A sweepline proof
• Optimality and inefficiency
• Parsing MELL proof nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof nets, garbage, and computations