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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2016
024619792016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We introduce a new, demand-driven variant of Spector’s bar recursion in the spirit of the BerardiBezem-Coquand functional of [4… (More)
Is this relevant?
2016
2016
We reformulate the bar recursion and induction principles in terms of recursive and wellfounded coalgebras. Bar induction was… (More)
Is this relevant?
2015
2015
We show how two iterated products of selection functions can both be used in conjunction with system T to interpret, via the… (More)
  • figure 1
Is this relevant?
2015
2015
This note supplies the proof of a theorem stated in the forthcoming book by Longley and Normann: namely, that Spector’s bar… (More)
Is this relevant?
2014
2014
Several extensions of Gödel’s system T with new forms of recursion have been designed for the purpose of giving a computational… (More)
  • figure 1
Is this relevant?
2013
2013
We show how Modified Bar-Recursion, a variant of Spector’s<lb>Bar-Recursion due to Berger and Oliva can be used to realize the… (More)
Is this relevant?
2012
2012
We show that Spector’s “restricted” form of bar recursion is sufficient (over system T ) to define Spector’s search functional… (More)
Is this relevant?
2010
2010
• Users may freely distribute the URL that is used to identify this publication. • Users may download and/or print one copy of… (More)
Is this relevant?
2006
2006
We introduce a variant of Spector’s bar recursion (called “modified bar recursion”) in finite types to give a realizability… (More)
Is this relevant?
1979
1979
For general information on bar recursion the reader should consult the papers of Spector [8], where it was introduced, Howard [2… (More)
Is this relevant?