117 search results - page 1 / 24 » Program Extraction from Classical Proofs |
LCC
1994
15 years 1 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
TYPES
1995
Springer
15 years 1 months ago
1995
Springer
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
78
Voted
TLCA
1993
Springer
15 years 1 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...