A logical account of pspace

DOI10.1145/1328438.1328456zbMath1295.68116OpenAlexW1986952332MaRDI QIDQ3189832

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

Publication date: 12 September 2014

Published in: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1328438.1328456

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)

Related Items (7)

The role of polymorphism in the characterisation of complexity by soft types ⋮ Bounded combinatory logic and lower complexity ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Unnamed Item ⋮ Linear logic by levels and bounded time complexity ⋮ On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy ⋮ Soft Linear Logic and Polynomial Complexity Classes

This page was built for publication: A logical account of pspace