An interpretation of system F through bar recursion

04/02/2018
by   Valentin Blot, et al.
0

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 relies on a realizability interpretation of second-order arithmetic. Due to Gödel's incompleteness theorem there is no proof of termination of system F within second-order arithmetic. However, for each individual term of system F there is a proof in second-order arithmetic that it terminates, with its realizability interpretation providing a bound on the number of reduction steps to reach a normal form. Using this bound, we compute the normal form through primitive recursion. Moreover, since the normalization proof of system F proceeds by induction on typing derivations, the translation is compositional. The flexibility of our method opens the possibility of getting a more direct translation that will provide an alternative approach to the study of polymorphism, namely through bar recursion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2018

Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control

We define a variant of realizability where realizers are pairs of a term...
research
04/25/2021

On Measure Quantifiers in First-Order Arithmetic (Long Version)

We study the logic obtained by endowing the language of first-order arit...
research
08/29/2023

Conservativity of Type Theory over Higher-order Arithmetic

We investigate how much type theory is able to prove about the natural n...
research
04/22/2019

Polymorphic Higher-order Termination

We generalise the termination method of higher-order polynomial interpre...
research
04/26/2023

Specifying programs with propositions and with congruences

We give a presentation of Krivine and Parigot's Second-order functional ...
research
01/10/2020

A computational interpretation of Zorn's lemma

We give a computational interpretation to an abstract instance of Zorn's...
research
08/15/2019

Lifting countable to uncountable mathematics

Ordinary, i.e.non-set theoretic mathematics is generally formalised in s...

Please sign up or login with your details

Forgot password? Click here to reset