# An interpretation of system F through bar recursion

@article{Blot2017AnIO,
title={An interpretation of system F through bar recursion},
author={Valentin Blot},
journal={2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
year={2017},
pages={1-12}
}
• Valentin Blot
• Published 2017
• Mathematics, Computer Science
• 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a fundamentally different computational behavior and their relationship is not well understood. We make a step towards a comparison by defining the first translation of system F into a simply-typed total language with a variant of bar recursion. This translation… Expand
5 Citations

#### Figures and Topics from this paper

Bar Induction is Compatible with Constructive Type Theory
• Computer Science
• J. ACM
• 2019
This work investigates the compatibility of several variants of BI with Constructive Type Theory (CTT), a dependent type theory in the spirit of Martin-Löf's extensional theory and provides novel insights regarding BI, such as the non-truncated version of BI on monotone bars being intuitionistically false. Expand
A sequent calculus with dependent types for classical arithmetic
A realizability interpretation à la Krivine of the authors' calculus is defined that allows us to prove normalization and soundness of classical call-by-need. Expand
Continuation-and-environment-passing style translations: a focus on call-by-need
• Computer Science
• 2019
This paper focuses on a sequent calculus presentation of a call-by-need $λ$-calculus with classical control, and presents a type system for the target language of their translation, which highlights a variant of Kripke forcing related to the environment-passing part of the translation. Expand
A constructive proof of dependent choice in classical arithmetic via memoization
This paper goes over the whole process, starting from Herbelin's calculus dPA${^\omega}$ until the introduction of its sequent calculus counterpart dLPA\$, to define a realizability interpretation a la Krivine of the authors' calculus that allows us to prove normalization and soundness. Expand
Réalisabilité classique et effets de bord
Cette these s'interesse au contenu calculatoire des preuves classiques, et plus specifiquement aux preuves avec effets de bord et a la realisabilite classique de Krivine. Le manuscrit est divise enExpand

#### References

SHOWING 1-10 OF 21 REFERENCES
Program Extraction from Normalization Proofs
From a constructive proof of strong normalization plus uniqueness of the long beta-normal form for the simply typed lambda-calculus a normalization program is extracted using Kreisel's modifiedExpand
The Girard-Reynolds isomorphism (second edition)
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2007
It is shown that the inductive naturals are exactly those values of type natural that satisfy Reynolds's notion of parametricity, and as a consequence characterize situations in which the Girard projection followed by the Reynolds embedding is also the identity. Expand
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis
It is shown, by means of their bar recursion operator, that the realizability models of ZF, obtained from usual models of lambda-calculus, satisfy the axiom of dependent choice, and these formulas are therefore realized by closed lambda_c-terms. Expand
MODIFIED BAR RECURSION AND CLASSICAL DEPENDENT CHOICE
• Mathematics
• 2004
We introduce a variant of Spector’s bar recursion in finite types (which we call “modified bar recursion”) to give a realizability interpretation of the classical axiom of dependent choice allowingExpand
Reduction-free normalisation for a polymorphic system
• Mathematics, Computer Science
• Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
• 1996
A semantical proof that every term of a combinator version of system F has a normal form is given, which is entirely formalisable in an impredicative constructive type theory. Expand
On the Computational Content of the Axiom of Choice
• Mathematics, Computer Science
• J. Symb. Log.
• 1998
This work presents a possible computational content of the negative translation of classical analysis with the Axiom of (countable) Choice and shows how to compute witnesses from proofs in classical analysis of ∃-statements and how to extract algorithms from proofs of ∀∃-Statements. Expand
Domains and lambda-calculi
• Computer Science, Mathematics
• Cambridge tracts in theoretical computer science
• 1998
This chapter discusses the development of lambda-calculi in CCC's of algebraic dcpo's, as well as its applications in recursion theory and category theory. Expand
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
• Computer Science
• 2008
This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both aExpand
Towards a theory of type structure
7)(D) = B[w][71t]#D] and delta is a functor from Funct(C, C) into C. Even before defining the functors arrow and delta, it can be shown that B maps every type expression into a functor from C T intoExpand
Types, Abstraction and Parametric Polymorphism
The findings of a Web-based questionnaire aimed at discovering both patterns of use of videoconferencing systems within HP and the reasons people give for either not using, or for using such systems are discussed. Expand