Coherence for sharing proof-nets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 742718 (Why is no real title available?)
- scientific article; zbMATH DE number 1523048 (Why is no real title available?)
- scientific article; zbMATH DE number 786493 (Why is no real title available?)
- scientific article; zbMATH DE number 970633 (Why is no real title available?)
- (Optimal) duplication is not elementary recursive
- A general theory of sharing graphs
- Coherence for sharing proof-nets
- Constructivism in mathematics. An introduction. Volume I
- Interaction Systems I: The theory of optimal reductions
- Interaction systems II: The practice of optimal reductions
- Linear logic
- Optimality and inefficiency: what isn't a cost model of the lambda calculus?
- Parallel beta reduction is not elementary recursive
- Proof nets, garbage, and computations
Cited in
(12)- Proof nets, garbage, and computations
- Parsing MELL proof nets
- scientific article; zbMATH DE number 7205326 (Why is no real title available?)
- Coherence for sharing proof nets
- Jumping Boxes
- Cooperation of background reasoners in theory reasoning by residue sharing
- Cooperative Repositories for Formal Proofs
- Light logics and optimal reduction: completeness and complexity
- Is the Optimal Implementation Inefficient? Elementarily Not
- scientific article; zbMATH DE number 1538029 (Why is no real title available?)
- Coherence for sharing proof-nets
- Cooperation in heterogeneous theorem prover networks (Diss., Univ. Kaiserslautern)
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 Q1398472)