On Bar Recursion and Choice in a Classical Setting

  • Valentin Blot
  • Colin Riba
Conference paper

DOI: 10.1007/978-3-319-03542-0_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8301)
Cite this paper as:
Blot V., Riba C. (2013) On Bar Recursion and Choice in a Classical Setting. In: Shan C. (eds) Programming Languages and Systems. APLAS 2013. Lecture Notes in Computer Science, vol 8301. Springer, Cham

Abstract

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 Countable 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 for the instances of the axiom of choice usually used in the realization of classical choice with Bar-Recursion, and where, moreover, the standard datatype of natural numbers is in the image of a CPS-translation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Valentin Blot
    • 1
  • Colin Riba
    • 1
  1. 1.ENS de LyonUniversité de Lyon, LIPFrance

Personalised recommendations