Linear additives

DOI10.4204/EPTCS.353.4MaRDI QIDQ6657785zbMATH OpenFDO

Authors Gianluca Curzi

Publication date 6 January 2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites work

• scientific article; zbMATH DE number 2185670 (Why is no real title available?)
• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 2061714 (Why is no real title available?)
• scientific article; zbMATH DE number 7559289 (Why is no real title available?)
• (In)efficiency and reasonable cost models
• A type-assignment of linear erasure and duplication
• BCK-combinators and linear \(\lambda\)-terms have types
• FUNCTIONAL PEARL Linear lambda calculus and PTIME-completeness
• From light logics to type assignments: a case study
• Logical Approaches to Computational Barriers
• On the computational complexity of cut-elimination in linear logic.
• On the invariance of the unitary cost model for head reduction
• Soft linear logic and polynomial complexity classes

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)