Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
From MaRDI portal
Publication:5453503
DOI10.2168/LMCS-3(4:10)2007zbMath1131.03032MaRDI QIDQ5453503
Kazushige Terui, Vincent Atassi, Patrick Baillot
Publication date: 1 April 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
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 (7)
The role of polymorphism in the characterisation of complexity by soft types ⋮ Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Polynomial time over the reals with parsimony ⋮ Light types for polynomial time computation in lambda calculus ⋮ Linear logic by levels and bounded time complexity ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
