On characterizations of the basic feasible functionals, Part I

Authors:
Robert J. Irwin;James S. Royer;Bruce M. Kapron
Affiliations:
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA/ (e-mail: rjirwin@ecs.syr.edu, royer@ecs.syr.edu);Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA/ (e-mail: rjirwin@ecs.syr.edu, royer@ecs.syr.edu);Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6, Canada/ (e-mail: bmkapron@maclure.csc.uvic.ca)
Venue:
Journal of Functional Programming
Year:
2001

Citing 21
Cited 9

The polynomial hierarchy and intuitionistic bounded arithmetic

Proc. of the conference on Structure in complexity theory
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Functional interpretations of feasibly constructive arithmetic

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A new characterization of Mehlhorn's polynomial time functionals (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Bounded linear logic: a modular approach to polynomial-time computability

Theoretical Computer Science
Predictive recursion and computational complexity

Predictive recursion and computational complexity
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
Subrecursive programming systems: complexity & succinctness

Subrecursive programming systems: complexity & succinctness
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
Computability and complexity: from a programming perspective

Computability and complexity: from a programming perspective
Light linear logic

Information and Computation
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
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Polynomial and abstract subrecursive classes

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Type two computational complexity

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity doctrines

Complexity doctrines

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
Theories with self-application and computational complexity

Information and Computation
On the computational complexity of Longeley's H functional

Theoretical Computer Science - Implicit computational complexity
A proof-theoretic characterization of the basic feasible functionals

Theoretical Computer Science
Adventures in time and space

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Feasible Iteration of Feasible Learning Functionals

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Computability over an arbitrary structure: sequential and parallel polynomial time

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Axiomatizing resource bounds for measure

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.