3 citations · 3 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2019
Type-two Iteration with Bounded Query Revision
Bruce M. Kapron, Florian Steinberg
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time com…
cs.CC2017★ 3 cited
Polynomial running times for polynomial-time oracle machines
Akitoshi Kawamura, Florian Steinberg
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possibl…