Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,120,633 papers from all fields of science
Search
Sign In
Create Free Account
Bar recursion
Bar recursion is a generalized form of recursion developed by C. Spector in his 1962 paper. It is related to bar induction in the same fashion that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Bar induction
Concatenation
Mathematical induction
Transfinite induction
Expand
Broader (1)
Recursion
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An Adequacy Theorem for Dependent Type Theory
T. Coquand
,
Simon Huber
Theory of Computing Systems
2018
Corpus ID: 253741008
We present a domain model of dependent type theory and use it to prove basic metatheoretic properties. In particular, we prove…
Expand
2018
2018
Majorizability Types , Assmeblies , and the Fan Theorem
Tao Gu
,
J. V. Oosten
2018
Corpus ID: 92987899
In this thesis we introduce the notion of majorizability types, and the category MMAsm of majorizability modified assemblies. The…
Expand
2015
2015
Coq as a Metatheory for Nuprl with Bar Induction
Vincent Rahli
,
M. Bickford
2015
Corpus ID: 17643428
These past few years, we have been experimenting in Nuprl with versions of Brouwer’s Bar Induction principle. Until recently we…
Expand
2015
2015
Bar recursion in classical realisability : dependent choice and well ordering of R
J. Krivine
arXiv.org
2015
Corpus ID: 9576699
This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi…
Expand
2014
2014
Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice
Thomas Powell
arXiv.org
2014
Corpus ID: 13528636
During the last twenty years or so a wide range of realizability interpretations of classical analysis have been developed. In…
Expand
2014
2014
Spector bar recursion over finite partial functions
Paulo Oliva
,
Thomas Powell
2014
Corpus ID: 123458983
We introduce a new, demand-driven variant of Spector's bar recursion in the spirit of the Berardi-Bezem-Coquand functional. The…
Expand
2012
2012
Exploring the Computational Content of the Infinite Pigeonhole Principle
Diana Ratiu
,
T. Trifonov
Journal of Logic and Computation
2012
Corpus ID: 13370556
The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the…
Expand
2009
2009
Proof-theoretical studies on the bounded functional interpretation
P. Engrácia
2009
Corpus ID: 123720129
Tese de doutoramento, Matematica (Algebra Logica e Fundamentos), 2009, Universidade de Lisboa, Faculdade de Ciencias
1992
1992
Bar recursion versus polymorphism
E. Barendsen
,
Bezem
1992
Corpus ID: 16214876
By constructing a counter, model we show that a certain appealing equation E has no solution in Girard's [1972] second order…
Expand
1981
1981
Ordinal analysis of simple cases of bar recursion
W. A. Howard
Journal of Symbolic Logic (JSL)
1981
Corpus ID: 28738765
The purpose of the following is to give an ordinal analysis of bar recursion of type 0 for the cases in which the bar recursion…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE