353 articles – 360 Notices  [english version]
HAL : hal-00483232, version 2

Fiche détaillée  Récupérer au format
Logical Methods in Computer Science (LMCS) 7, 3 (2011) 1-47
Versions disponibles :
Realizability algebras: a program to well order R
Jean-Louis Krivine 1
(18/07/2011)

We give a method to transform into programs, classical proofs using a well ordering of the reals. The technology uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.
1 :  Preuves, Programmes et Systèmes (PPS)
CNRS : UMR7126 – Université Paris VII - Paris Diderot
Informatique/Logique en informatique
Curry-Howard correspondence – combinatory logic – lambda-calculus – axiom of choice
Liste des fichiers attachés à ce document : 
PDF
Well_order_HAL.pdf(530.3 KB)
PS
Well_order_HAL.ps(1 MB)