Non-linearity as the Metric Completion of Linearity
From MaRDI portal
Publication:5300890
DOI10.1007/978-3-642-38946-7_3zbMath1381.03022OpenAlexW205216857MaRDI QIDQ5300890
Publication date: 28 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38946-7_3
Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Linear logic
- Resource modalities in tensor logic
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Light types for polynomial time computation in lambda calculus
- Infinitary lambda calculus
- Linear types and non-size-increasing polynomial time computation.
- Full abstraction for PCF
- Locus Solum: From the rules of logic to the logic of rules
- Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
- An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
- The Duality of Computation under Focus
- Session Types as Intuitionistic Linear Propositions
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Linear Dependent Types and Relative Completeness
- Non-linearity as the Metric Completion of Linearity
- A lambda calculus for quantum computation with classical control
- Finiteness spaces
- Rewriting Techniques and Applications
