A syntactical analysis of non-size-increasing polynomial time computation

DOI10.1145/507382.507386zbMath1365.03028OpenAlexW2126864471MaRDI QIDQ5738960

Helmut Schwichtenberg, Klaus Aehlig

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

complexitylinear logiclambda calculus

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Linear types and non-size-increasing polynomial time computation. ⋮ On the computational complexity of cut-reduction ⋮ An arithmetic for polynomial-time computation ⋮ An arithmetic for non-size-increasing polynomial-time computation

This page was built for publication: A syntactical analysis of non-size-increasing polynomial time computation