FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897769
DOI10.1007/11590156zbMath1172.68477OpenAlexW2484051058MaRDI QIDQ5897769
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
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 (8)
A Categorical Setting for Lower Complexity ⋮ Light logics and optimal reduction: completeness and complexity ⋮ The weak lambda calculus as a reasonable machine ⋮ Realizability models and implicit complexity ⋮ A semantic proof of polytime soundness of light affine logic ⋮ Light types for polynomial time computation in lambda calculus ⋮ A Fresh Look at the λ-Calculus ⋮ A quantitative model for simply typed λ-calculus
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science