Robert J. Irwin, Bruce M. Kapron, James S. Royer  Home/Search
Context Related
| csr.uvic.ca/~bmkapron/P...jfpfunc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csr.uvic.ca/~bmkapron/bibl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP 2 , that characterizes the type-2 basic feasible functionals. ITLP 2 is based on Bellantoni and Cook's [BC92] and Leivant's [Lei95] type-theoretic characterization of polynomial-time and turns out to be closely related to Kapron and Cook's [KC91, KC96] machine-based characterization of the type-2 basic feasible functionals. # Dept. of Elec. Eng. and Computer Science; Syracuse University; Syracuse, ... (Update)
Cited by: More
Feasible Functionals And Intersection Of Ramified Types - Leivant (2003) (Correct)
Active bibliography (related documents): More All
4.8: On Characterizations of the Basic Feasible Functionals, Part I - Irwin, Kapron, Royer (2001) (Correct)
1.6: On Characterizations of the Basic Feasible Functionals, Part II - Irwin, Kapron, Royer (2001) (Correct)
1.4: On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (Correct)
Similar documents based on text: More All
0.5: Separating Notions of Higher-Type Polynomial-Time (Extended .. - Irwin, Kapron, Royer (Correct)
0.5: Notions of computability at higher types I - Longley (2001) (Correct)
Related documents from co-citation: More All
2: Functional interpretations of feasible constructive arithemtic (context) - Cook, Urquhart - 1989
BibTeX entry: (Update)
R. Irwin, B.M. Kapron, and J. Royer. On characterizations of the basic feasible functionals part i. Journal of Functional Programming, 11:117--153, 2001. http://citeseer.ist.psu.edu/article/irwin99characterizations.html More
@misc{ irwin01characterizations,
author = "R. Irwin and B. Kapron and J. Royer",
title = "On characterizations of the basic feasible functionals part",
text = "R. Irwin, B.M. Kapron, and J. Royer. On characterizations of the basic
feasible functionals part i. Journal of Functional Programming, 11:117--153,
2001.",
year = "2001",
url = "citeseer.ist.psu.edu/article/irwin99characterizations.html" }
Citations (may not include all citations):534 The complexity of theorem proving procedures (context) - Cook - 1971
127 with an application to the entscheidungsproblem (context) - Turing, numbers - 1936
96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
58 Linear types and non-size-increasing polynomial time computa.. - Hofmann - 1999
51 Functional interpretations of feasibly constructive arithmet.. (context) - Cook, Urquhart - 1993
51 Functional interpretations of feasibly constructive arithmet.. (context) - Cook, Urquhart - 1989
50 Cambridge University Press (context) - Russell, of et al. - 1903
44 Uber eine bisher noch nicht benutzte Erweiterung des finiten (context) - Godel - 1958
39 Mathematical logic as based on the theory of types (context) - Russell - 1908
39 Bounded linear logic: A modular approach to polynomial time .. (context) - Girard, Scedrov et al. - 1992
38 Ramified recurrence and computational complexity I: Word rec.. (context) - Leivant - 1995
34 Computability and complexity from a programming perspective (context) - Jones - 1997
32 Princeton University Press (context) - Nelson, arithmetic - 1986
31 Information and Computation (context) - Girard, logic - 1998
26 Predicative recursion and computational complexity - Bellantoni - 1992
26 Polynomial and abstract subrecursive classes (context) - Mehlhorn - 1974
26 Polynomial and abstract subrecursive classes (context) - Mehlhorn - 1976
22 Type systems for polynomial-time computation - Hofmann - 1999
19 A new characterization of type 2 feasibility - Kapron, Cook - 1996
16 A foundational delineation of poly-time (context) - Leivant - 1994
16 The polynomial hierarchy and intuitionistic bounded arithmet.. (context) - Buss - 1986
14 A foundational delineation of computational feasibility (context) - Leivant - 1991
13 Uber das unendliche (context) - Hilbert - 1925
13 Complexity theory of higher type functionals (context) - Seth - 1994
12 Subrecursive programming systems: Complexity & succinctness (context) - Royer, Case - 1994
11 Computability and complexity of higher type functions (context) - Cook - 1991
10 Computable and recursively countable functions of higher typ.. (context) - Gandy, Hyland - 1977
10 ne logic (context) - Asperti - 1998
10 Characterizations of the basic feasible functions of finite .. (context) - Cook, Kapron - 1990
9 Turing machine characterizations of feasible functionals of .. (context) - Seth - 1995
9 There is no recursive axiomatization for feasible functional.. (context) - Seth - 1992
8 Characterising polytime through higher type recursion (context) - Bellantoni, Niggl et al.
8 Type two computational complexity (context) - Constable - 1973
7 A new characterization of Mehlhorn's polynomial time functio.. (context) - Kapron, Cook - 1991
6 Complexity for type-2 relations (context) - Townsend - 1990
6 The intrinsic computational di#culty of functions (context) - Cobham - 1965
5 a hitherto unutilized extension of the finitary standpoint (context) - Godel - 1990
4 Complexity doctrines - Otto - 1995
3 Partial recursive functionals and e#ective operations (context) - Kreisel, Lacombe et al. - 1957
2 Semantics versus syntax versus computations: Machine models .. (context) - Royer - 1997
2 Logical Foundations of Computer Science: Third International.. (context) - Leivant, in et al. - 1994
2 Some desirable conditions for feasible functions of type (context) - Seth - 1993
Documents on the same site (http://csr.uvic.ca/~bmkapron/bibl.html): More
Characterizations of the Basic Feasible Functionals of Finite.. - Cook, Kapron (1990) (Correct)
Limits on the Power of Parallel Random Access.. - Fich.. (1993) (Correct)
Feasibly Continuous Type-Two Functionals - Kapron (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC