12 citations · 21 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 1 cited
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.LO2019★ 2 cited
Computable analysis and notions of continuity in Coq
Florian Steinberg, Laurent Thery, Holger Thies
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of oper…