3 citations · 5 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
The encodability hierarchy for PCF types
John Longley
Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type is encodable as a definable retract of :…
cs.LO2018
Bar recursion is not computable via iteration
John Longley
We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus mi…