Hostname: page-component-7bb8b95d7b-qxsvm Total loading time: 0 Render date: 2024-09-16T07:07:19.337Z Has data issue: false hasContentIssue false

On characterizations of the basic feasible functionals, Part I

Published online by Cambridge University Press:  26 March 2001

ROBERT J. IRWIN
Affiliation:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA; (e-mail: [email protected], [email protected])
JAMES S. ROYER
Affiliation:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA; (e-mail: [email protected], [email protected])
BRUCE M. KAPRON
Affiliation:
Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6, Canada; (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni and Cook's (1992) and Leivant's (1995) type-theoretic characterization of polynomial-time, and turns out to be closely related to Kapron and Cook's (1991; 1996) machine-based characterization of the type-2 basic feasible functionals.

Type
Research Article
Copyright
© 2001 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.