Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) (1990)

Cached

Download Links

by Stephen A. Cook , Bruce M. Kapron
Venue:Feasible Mathematics: A Mathematical Sciences Institute Workshop
Citations:27 - 6 self

Active Bibliography

3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
4 Parallel computable higher type functionals (Extended Abstract) – P. Clote, A. Ignatovic, B.M. Kapron - 1993
6 A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) – Bruce Kapron, Stephen A. Cook - 1991
Feasible Functionals And Intersection Of Ramified Types – Daniel Leivant - 2003
10 Semantics vs. Syntax vs. Computations -- Machine Models For Type-2 . . . – James Royer - 1997
12 Notions of computability at higher types I – John Longley - 2005
32 Computability and recursion – Robert I. Soare - 1996
Author manuscript, published in "21st International Symposium on Algorithms and Computation- ISAAC 2010 (2010)" Interpretation of stream programs: characterizing type 2 polynomial time complexity – Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux - 2010
3 A Note on the Relation between Polynomial Time Functionals and Constable's Class K – P. Clote - 1996
4 On the ubiquity of certain total type structures – John Longley - 2007
3 Adventures in time and space – Norman Danner, James, S. Royer - 2006
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
4 Weak theories of operations and types – Thomas Strahm
179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
1 On the Proof Theory of Applicative Theories – Thomas Adrian Strahm - 1996
11 Computational Complexity and Induction for Partial Computable Functions in Type Theory – Robert L. Constable, Karl Crary - 1999
1 Graded Multicategories of Polynomial-time Realizers (Extended Abstract) – R.A.G. Seely, John Abbott College, Ste Anne De Bellevue - 1989