Non-linearity as the metric completion of linearity
From MaRDI portal
(Redirected from Publication:5300890)
Recommendations
- An infinitary affine lambda-calculus isomorphic to the full lambda-calculus
- Non-uniform polytime computation in the infinitary affine lambda-calculus
- A mixed -calculus
- Linearity in the non-deterministic call-by-value setting
- A functorial bridge between the infinitary affine lambda-calculus and linear logic
Cites work
- A lambda calculus for quantum computation with classical control
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- An infinitary affine lambda-calculus isomorphic to the full lambda-calculus
- Finiteness spaces
- Full abstraction for PCF
- scientific article; zbMATH DE number 1722649 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Infinitary lambda calculus
- Interactive models of computation and program behavior
- Light types for polynomial time computation in lambda calculus
- Linear dependent types and relative completeness
- Linear logic
- Linear types and non-size-increasing polynomial time computation.
- Locus solum: From the rules of logic to the logic of rules.
- Non-linearity as the metric completion of linearity
- Preservation of strong normalisation modulo permutations for the structural -calculus
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Resource modalities in tensor logic
- Rewriting Techniques and Applications
- Session types as intuitionistic linear propositions
- The duality of computation under focus
- The optimal implementation of functional programming languages
Cited in
(4)
This page was built for publication: Non-linearity as the metric completion of linearity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300890)
