On Bar Recursion and Choice in a Classical Setting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

On Bar Recursion and Choice in a Classical Setting

Résumé

We show how Modified Bar-Recursion, a variant of Spector's Bar-Recursion due to Berger and Oliva can be used to realize the Axiom of Choice in Parigot's Lambda-Mu-calculus, a direct-style language for the representation and evaluation of classical proofs. We rely on Hyland-Ong innocent games. They provide a model to perform the usual infinitary reasoning on Bar-Recursion needed for the realization of classical choice, and where, moreover, the standard datatype of natural numbers is in the image of a CPS-translation.
Fichier principal
Vignette du fichier
funbrho.pdf (412.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00835540 , version 1 (21-06-2013)

Identifiants

Citer

Valentin Blot, Colin Riba. On Bar Recursion and Choice in a Classical Setting. Programming Languages and Systems - 11th Asian Symposium, APLAS 2013, Dec 2013, Melbourne, Australia. pp.349-364, ⟨10.1007/978-3-319-03542-0_25⟩. ⟨hal-00835540⟩
251 Consultations
276 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More