The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Theories with self-application and computational complexity
Information and Computation
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science
Hi-index | 0.00 |