Relating Classical Realizability and Negative Translation for Existential Witness Extraction

Authors:
Alexandre Miquel
Affiliations:
Université Paris 7 & LIP (ENS Lyon),
Venue:
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Year:
2009

Citing 5
Cited 0

Proofs and types

Proofs and types
A general storage theorem for integers in call-by-name &lgr;-calculus

Theoretical Computer Science
Dependent choice, 'quote' and the clock

Theoretical Computer Science
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic

Fundamenta Informaticae - Logic for Pragmatics
Classical Program Extraction in the Calculus of Constructions

CSL '07/EACSL '07, Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Friedman showed how to turn a classical proof of a $\Sigma^0_1$ formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classical proofs of such formulae. In this paper we show how to achieve the same goal efficiently using Krivine realizability with primitive numerals, and prove that the corresponding program is but the direct-style equivalent (using call-cc) of the CPS-style program underlying Friedman's method.