Proofs as Efficient Programs

DOI10.1007/978-88-470-0784-0_8zbMath1195.03035OpenAlexW301327174MaRDI QIDQ3654818

Ugo Dal Lago, Simone Martini

Publication date: 11 January 2010

Published in: Deduction, Computation, Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-88-470-0784-0_8

zbMATH Keywords

survey paperimplicit computational complexityCurry-Howard correspondencecomplexity class

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Complexity of proofs (03F20)

This page was built for publication: Proofs as Efficient Programs