Computer Science Logic

DOI10.1007/11538363zbMath1136.03333OpenAlexW2479351976MaRDI QIDQ5394596

Mircea-Dan Hernest

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

zbMATH Keywords

Program extraction from (classical) proofsProof MiningBerger's uniform quantifiersComplexity of extracted programsGödel's Functional interpretationProof-Carrying Code

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07) Functionals in proof theory (03F10)

Related Items (3)

Light Dialectica revisited ⋮ A functional interpretation for nonstandard arithmetic ⋮ Light Dialectica Program Extraction from a Classical Fibonacci Proof

This page was built for publication: Computer Science Logic