Robert J. Irwin, Bruce M. Kapron, James S. Royer  Home/Search
Context Related
| syr.edu/users/royer/p2US.ps 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: syr.edu/people/royer/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper and its predecessor [IKR01] consider several of these characterizations|some old, some new|with the goals of clarifying their underlying ideas and of placing these ideas into something like a uniform framework. We hope to provide a much sharper account of BFF than heretofore and to do this in a way that is accessible to both the complexity theory and the programming languages communities (Update)
Cited by: More
Feasible Functionals And Intersection Of Ramified Types - Leivant (2003) (Correct)
Similar documents (at the sentence level):
46.4%: On Characterizations of the Basic Feasible Functionals, Part II - Irwin, Kapron, Royer (2001) (Correct)
43.1%: On Characterizations of the Basic Feasible Functionals Part II - Irwin, Kapron, Royer (2002) (Correct)
Active bibliography (related documents): More All
1.1: On Characterizations of the Basic Feasible Functionals, Part I - Irwin, Kapron, Royer (2001) (Correct)
0.9: Computability and Recursion - Soare (1996) (Correct)
0.5: Higher-Order Linear Ramified Recurrence - Lago, Martini, Roversi (2004) (Correct)
Similar documents based on text: More All
0.4: Separating Notions of Higher-Type Polynomial-Time (Extended .. - Irwin, Kapron, Royer (Correct)
0.3: A Proof-Theoretic Characterization of the Basic Feasible.. - Strahm (2002) (Correct)
0.3: Characterizations of the Basic Feasible Functionals of Finite.. - Cook, Kapron (1990) (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/irwin02characterizations.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/irwin02characterizations.html" }
Citations (may not include all citations):660 An introduction to Kolmogorov complexity and its application.. - Li, Vit - 1997
419 A formulation of the simple theory of types (context) - Church - 1940
259 Combinatory logic (context) - Curry, Feys - 1958
224 Semantics of programming languages: Structures and technique.. (context) - Gunter - 1992
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
56 Theory of recursive functions and e ective computability (context) - Rogers
51 Functional interpretations of feasibly constructive arithmet.. (context) - Cook, Urquhart - 1993
51 Functional interpretations of feasibly constructive arithmet.. (context) - Cook, Urquhart - 1989
31 Information and Computation (context) - Girard, logic - 1998
30 Basic simple type theory (context) - Hindley - 1997
26 Lambda calculus characterizations of polytime (context) - Leivant, Marion - 1993
24 The intrinsic computational diculty of functions (context) - Cobham - 1965
22 Type systems for polynomial-time computation - Hofmann - 1999
22 Foundations of recursion theory (context) - Platek - 1966
19 A type-theoretical alternative to ISWIM (context) - Scott
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
16 Predicative recurrence and computational complexity IV: Pred.. (context) - Leivant, Marion - 2002
14 to appear in Annals of Pure and Applied Logic (context) - Longley, realizable et al. - 1998
13 On characterizations of the basic feasible functional (context) - Irwin, Kapron et al. - 2001
13 Complexity theory of higher type functionals (context) - Seth - 1994
12 Subrecursive programming systems: Complexity & succinctness (context) - Royer, Case - 1994
11 Indexings of subrecursive classes (context) - Kozen - 1980
11 An application of category-theoretic semantics to the charac.. - Hofmann - 1997
10 Programming languages capturing complexity classes (context) - Hofmann - 2000
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. - 2000
8 Feasible computation in higher types (context) - Kapron - 1991
8 Uber eine bisher noch nicht benutzte Erweiterung des niten (context) - odel - 1958
7 Rami ed recurrence and computational complexity I: Word recu.. (context) - Leivant - 1995
7 A new characterization of Mehlhorn's polynomial time functio.. (context) - Kapron, Cook - 1991
7 Handbook of Computability Theory (context) - Normann, functionals - 1999
6 Turing-machine computable functionals of nite types II (context) - Kleene - 1962
6 Bulletin of the American Mathematical Society (context) - Odifreddi, reducibilities - 1981
6 Turing machine computable functionals of nite types (context) - Kleene
5 the computational complexity of Longley's H functional (context) - Royer - 2000
5 Expressibility of functions in Scott's LCF language (context) - Sazonov - 1976
4 Characterizations of the basic feasible functions of nite ty.. (context) - Cook, Kapron - 1989
4 draft manuscript available from httpwww (context) - Notions, at et al. - 2001
4 Characterizations of the basic feasible functions of nite ty.. (context) - Cook, Kapron - 1990
4 Recursive functionals and quanti ers of nite types (context) - Kleene - 1963
4 calculus to cartesian closed categories (context) - Lambek - 1980
3 De nierbare funktionen im -kalkul mit typen (context) - Schwichtenberg - 1976
2 a hitherto unutilized extension of the nitary standpoint (context) - odel - 1990
2 A combinatory algebra for sequential functionals of nite typ.. (context) - van Oosten
http://xxx.lanl.gov/abs/cs.LO/0
Documents on the same site (http://top.cis.syr.edu/people/royer/papers.html): More
The Structure of Complete Degrees - Kurtz, Mahaney, Royer (1990) (Correct)
On Closure Properties of Bounded 2-Sided Error Complexity Classes - Regan, Royer (1994) (Correct)
Active Transport in Biological Computing (Preliminary.. - Kurtz, Mahaney, Royer.. (1996) (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