Higher type recursion, ramification and polynomial time

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 17-30

  Bellantoni, Stephen J ^a   Niggl, Karl Heinz ^b   Schwichtenberg, Helmut ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF MUNICH   (Germany)

Author keywords

Higher type recursion; Lambda calculus; Normalisation; Polynomial time; Ramified recursion

Indexed keywords

EID: 0013030652     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00006-3     Document Type: Article

References (18)

1. S.J. Bellantoni, Characterizing parallel polylog time using type 2 recursions with polynomial output length, in: D. Leivant (Ed.), Logic and Computational Complexity, Springer Lecture Notes in Computer Science, Vol. 960, 1995, pp. 253-268.
2. S.J. Bellantoni, S. Cook, A new recursion-theoretic characterization of the polytime functions, Comput. Complexity 2 (1992) 97-110.
3. S.J. Bellantoni, K.-H. Niggl, Ranking primitive recursions: The low Grzegorczyk classes revisited, SIAM J. Comput. 29 (2000) 401-415.
4. S.A. Cook, B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Birkhäuser, Boston, 1990, pp. 71-98.
5. M.D. Davis, E.J. Weyker, Computability, Complexity and Languages. Fundamentals of theoretical computer science, Academic Press, New York, 1983.
6. J.Y. Girard, Light linear logic, Inform, and Comput. 143 (1998) 175-204.
7. K. Gödel, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica 12 (1958) 280-287.
8. D. Hilbert, Über das Unendliche, Math. Ann. 95 (1925) 161-190.
9. M. Hofmann, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, Proc. CSL '97, Aarhus, Springer Lecture Notes in Computer Science, Vol. 1414 (1998) 275-294.
10. M. Hofmann, Typed lambda calculi for polynomial-time computation, Habilitation Thesis, TU Darmstadt, 1998.
11. F. Joachimski, R. Matthes, Short proofs of normalisation for the simply-typed λ-calculus, permutative conversions and Gödel's T, 1998, submitted.
12. D. Leivant, Subrecursion and lambda representation over free algebras, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Perspectives in Computer Science, Birkhäuser-Boston, New York, 1990, pp. 281-291.
13. D. Leivant, Predicative recurrence in finite type, in: A. Nerode, Y.V. Matiyasevisch (Eds.), Logical Foundations of Computer Science, Springer Lecture Notes in Computer Science, Vol. 813, Springer, Berlin, 1994, pp. 227-239.
14. D. Leivant, Ramified recurrence and computational complexity I: Word recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Perspectives in Computer Science, Birkhäuser, Boston, 1994, pp. 320-343.
15. D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity IV: Predicative functionals and poly-space, Inform, and Comput., to appear.
16. K.-H. Niggl, The μ-measure as a tool for classifying computational complexity, Arch. Math. Logic (1999) to appear.
17. H. Simmons, The realm of primitive recursion, Arch. Math. Logic 27 (1988) 177-188.
18. A.S. Troelstra, H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, Cambridge, 1996.