Soft Linear Logic and Polynomial Complexity Classes

DOI10.1016/j.entcs.2008.03.066zbMath1277.03027OpenAlexW2064981447MaRDI QIDQ2866738

Jean-Yves Marion, Marco Gaboardi, Simonetta Ronchi della Rocca

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.066

zbMATH Keywords

linear logicimplicit computational complexitypolynomial spacetype assignment

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (2)

The role of polymorphism in the characterisation of complexity by soft types ⋮ Bounded combinatory logic and lower complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Soft linear logic and polynomial time
• A call-by-name lambda-calculus machine
• Relationships between nondeterministic and deterministic tape complexities
• A logical account of pspace
• A Soft Type Assignment System for λ-Calculus
• Alternation

This page was built for publication: Soft Linear Logic and Polynomial Complexity Classes