Higher Type Recursion, Ramification and Polynomial Time (1999)

by S. Bellantoni , K.-H. Niggl , H. Schwichtenberg
Venue:Annals of Pure and Applied Logic
Citations:22 - 3 self

Documents Related by Co-Citation

179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
57 Predicative recurrence and computational complexity I: word recurrence and poly-time – D Leivant - 1994
69 Linear Types and Non-Size-Increasing Polynomial Time Computation – Martin Hofmann - 1998
21 Safe recursion with higher types and BCK-algebra – Martin Hofmann - 2000
14 Predicative recurrence in finite type – D Leivant - 1994
616 Light Linear Logic – Jean-yves Girard
37 Stratified Functional Programs and Computational Complexity – Daniel Leivant - 1993
56 Light Affine Logic – A. Asperti - 1998
48 Soft Linear Logic and Polynomial Time – Yves Lafont - 2002
38 Classes of predictably computable functions – R W Ritchie - 1963
15 Type systems for polynomial-time computation, Habilitation thesis – M Hofmann - 1999
151 The intrinsic computational difficulty of functions – A Cobham - 1965
9 Typed lambda calculi for polynomial-time computation. Habilitation thesis – M Hofmann - 1998
145 Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes – Kurt Gödel - 1958
22 Predicative recursion and the polytime hierarchy – S Bellantoni - 1995
14 Light affine lambda calculus and polytime strong normalization. Archive for Mathematical Logic – Kazushige Terui - 2007
15 Predicative recurrence and computational complexity IV: Predicative functionals and poly-space. should be published – D Leivant, J-Y Marion - 1994
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
27 Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) – Stephen A. Cook, Bruce M. Kapron - 1990