Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
From MaRDI portal
Publication:3613335
DOI10.1007/11874683_10zbMath1225.03084OpenAlexW1833133360MaRDI QIDQ3613335
Vincent Atassi, Kazushige Terui, Patrick Baillot
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_10
Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (3)
Light linear logics with controlled weakening: expressibility, confluent strong normalization ⋮ Light Linear Logic with Controlled Weakening ⋮ Light types for polynomial time computation in lambda calculus
This page was built for publication: Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
