Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,940,389 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
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
Bar recursion as primitive recursion with nonstandard numbers
Sam Sanders
2015
Corpus ID: 123907873
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
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
La ≪ bar récursion ≫ en réalisabilité classique : choix dépendant et bon ordre sur R
J. Krivine
2014
Corpus ID: 171513516
T. Streicher a montre [7], en utilisant un operateur de bar recursion, que les modeles de ZF, associes aux algebres de…
Expand
2013
2013
J an 2 01 3 Double-negation Shift as a constructive principle
Danko Ilik
2013
Corpus ID: 45059134
We consider the Double-negation Shift (DNS) as a constructive principle in its own right and its effect on modified realizability…
Expand
2005
2005
– Termination and Complexity in Higher Types – Case for Support 1 Part 1 Previous research track record
Ulrich Berger
2005
Corpus ID: 11344971
My main research areas are Domain Theory, Proof Theory and Lambda Calculi with Types. Below, I briefly describe those parts of my…
Expand
2005
2005
Continuous Semantics for Termination Proofs
Ulrich Berger
Spatial Representation
2005
Corpus ID: 485646
We prove a general strong normalization theorem for higher type rewrite systems based on Tait's strong computability predicates…
Expand
2003
2003
Polymorphic extensions of simple With an application to a bar minimization
E. Barendsen
,
M. Bezem
2003
Corpus ID: 207781290
The technical contribution of this paper is threefold. First we show how to encode ftmctionals in a ‘flat’ applicative structure…
Expand