3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.LO2020
Continuous and monotone machines
Michal Konečný, Florian Steinberg, Holger Thies
We investigate a variant of the fuel-based approach to modeling diverging computation in type theories and use it to abstractly capture the essence of oracle Turing machines. The r…
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…