Proof nets, garbage, and computations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185715 (Why is no real title available?)
- 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 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 786493 (Why is no real title available?)
- scientific article; zbMATH DE number 1444323 (Why is no real title available?)
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- A general theory of sharing graphs
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Coherence for sharing proof-nets
- Computational interpretations of linear logic
- Interaction systems II: The practice of optimal reductions
- Linear logic
- Optimality and inefficiency: what isn't a cost model of the lambda calculus?
- Parsing MELL proof nets
- Sequent reconstruction in LLM -- A sweepline proof
- The optimal implementation of functional programming languages
Cited in
(8)- scientific article; zbMATH DE number 2020177 (Why is no real title available?)
- scientific article; zbMATH DE number 7456059 (Why is no real title available?)
- Cut elimination in multifocused linear logic
- Coherence for sharing proof nets
- Multi-focused cut elimination
- scientific article; zbMATH DE number 2185715 (Why is no real title available?)
- A proof-theoretic investigation of a logic of positions
- Coherence for sharing proof-nets
This page was built for publication: Proof nets, garbage, and computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589650)