Linear additives
From MaRDI portal
Publication:6657785
DOI10.4204/EPTCS.353.4MaRDI QIDQ6657785FDOQ6657785
Authors: Gianluca Curzi 
Publication date: 6 January 2025
Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Soft linear logic and polynomial complexity classes
- Title not available (Why is that?)
- On the computational complexity of cut-elimination in linear logic.
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- Title not available (Why is that?)
- Title not available (Why is that?)
- BCK-combinators and linear \(\lambda\)-terms have types
- On the invariance of the unitary cost model for head reduction
- A type-assignment of linear erasure and duplication
- From light logics to type assignments: a case study
- FUNCTIONAL PEARL Linear lambda calculus and PTIME-completeness
- (In)efficiency and reasonable cost models
- Title not available (Why is that?)
This page was built for publication: Linear additives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657785)
