Coherence for sharing proof nets
DOI10.1007/3-540-61464-8_54zbMATH Open1503.03047OpenAlexW2152768051MaRDI QIDQ5055862FDOQ5055862
Authors: Simone Martini, Stefano Guerrini, Andrea Masini 
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_54
Recommendations
Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Linear logic
- Optimal reductions in interaction systems
- Title not available (Why is that?)
- Optimality and inefficiency: what isn't a cost model of the lambda calculus?
- Title not available (Why is that?)
- Interaction systems II: The practice of optimal reductions
- Title not available (Why is that?)
- δο!∈=1 Optimizing optimal λ-calculus implementations
- Title not available (Why is that?)
Cited In (10)
- Proof nets, garbage, and computations
- Title not available (Why is that?)
- From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
- Cooperation of background reasoners in theory reasoning by residue sharing
- Cooperative Repositories for Formal Proofs
- Title not available (Why is that?)
- Proof nets and the linear substitution calculus
- Coherence for sharing proof-nets
- Cooperation in heterogeneous theorem prover networks (Diss., Univ. Kaiserslautern)
- Title not available (Why is that?)
This page was built for publication: Coherence for sharing proof nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055862)
