Proof nets and the linear substitution calculus
From MaRDI portal
(Redirected from Publication:1623116)
Recommendations
Cited in
(29)- A nonstandard standardization theorem
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- A strong bisimulation for a classical term calculus
- is for Dialectica
- Tight typings and split bounds, fully developed
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
- scientific article; zbMATH DE number 6296859 (Why is no real title available?)
- The spirit of node replication
- scientific article; zbMATH DE number 7456059 (Why is no real title available?)
- Quantitative types for the linear substitution calculus
- Coherence for sharing proof nets
- scientific article; zbMATH DE number 7324256 (Why is no real title available?)
- scientific article; zbMATH DE number 2134911 (Why is no real title available?)
- A Fresh Look at the λ-Calculus
- Jumping Boxes
- Proof nets as formal Feynman diagrams
- Head linear reduction and pure proof net extraction
- Linear lambda calculus and deep inference
- Node Replication: Theory And Practice
- Proof nets and the call-by-value \(\lambda\)-calculus
- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
- Mirroring call-by-need, or values acting silly
- scientific article; zbMATH DE number 7359406 (Why is no real title available?)
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Sharing and linear logic with restricted access
- Coherence for sharing proof-nets
- Resource operators for \(\lambda\)-calculus
- A fully abstract model of PCF based on extended addressing machines
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
This page was built for publication: Proof nets and the linear substitution calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623116)
