Hostname: page-component-745bb68f8f-f46jp Total loading time: 0 Render date: 2025-01-27T03:02:28.582Z Has data issue: false hasContentIssue false
  • English
  • Français

On characterizations of the basic feasible functionals, Part I

Published online by Cambridge University Press:  26 March 2001

ROBERT J. IRWIN ,
JAMES S. ROYER  and
BRUCE M. KAPRON
ROBERT J. IRWIN
Affiliation:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA; (e-mail: rjirwin@ecs.syr.edu, royer@ecs.syr.edu)
JAMES S. ROYER
Affiliation:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA; (e-mail: rjirwin@ecs.syr.edu, royer@ecs.syr.edu)
BRUCE M. KAPRON
Affiliation:
Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6, Canada; (e-mail: bmkapron@maclure.csc.uvic.ca)
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
Information
Journal of Functional Programming , Volume 11 , Issue 1 , January 2001 , pp. 117 - 153
Copyright
© 2001 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.