Functional interpretations of feasibly constructive arithmetic

Authors:
S. Cook;A. Urquhart
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada;Department of Philosophy, University of Toronto, Toronto, Canada
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

The polynomial hierarchy and intuitionistic bounded arithmetic

Proc. of the conference on Structure in complexity theory
Exponential time and bounded arithmetic

Proc. of the conference on Structure in complexity theory
Feasibly constructive proofs and the propositional calculus (Preliminary Version)

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

A new recursion-theoretic characterization of the polytime functions (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
On characterizations of the basic feasible functionals, Part I

Journal of Functional Programming
Feasible functions over co-inductive data

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation

Hi-index	0.00