Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
A New Characterization of Type-2 Feasibility
SIAM Journal on Computing
Semantics vs syntax vs computations: machine models for type-2 polynomial-time bounded functionals
Journal of Computer and System Sciences - special issue on complexity theory
Predicative Recurrence in Finite Types
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
On the Computational Complexity of Type 2 Functionals
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Polynomial time computable arithmetic and conservative extensions
Polynomial time computable arithmetic and conservative extensions
Theories with self-application and computational complexity
Information and Computation
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
| Hi-index | 5.23 |
We provide a natural characterization of the type two Mehlhorn-Cook-Urquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in (Inform. Comput. 185 (2003) 263), thus providing a proof of a result claimed in the conclusion of Strahm (2003). This further characterization of the basic feasible functionals underpins their importance as a key candidate for the notion of type two feasibility.