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

Active Bibliography

3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
1 A New "Feasible" Arithmetic – S. Bellantoni, Martin Hofmann - 2000
11 The Implicit Computational Complexity of Imperative Programming Languages – Lars Kristiansen - 2001
3 Tiering as a Recursion Technique – Harold Simmons
Feasible Functionals And Intersection Of Ramified Types – Daniel Leivant - 2003
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation – Luca Roversi - 804
19 Soft lambda-calculus: a language for polynomial time computation – Patrick Baillot, Virgile Mogbil - 2004
1 On Tiered Small Jump Operators – JEAN-YVES MARION
5 Semantics of Linear/modal Lambda Calculus – Martin Hofmann - 1998
11 An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras – Martin Hofmann, Martin Hofmann Darmstadt - 1997
21 Safe recursion with higher types and BCK-algebra – Martin Hofmann - 2000
13 TYPE SYSTEMS FOR POLYNOMIAL-TIME COMPUTATION – Martin Hofmann - 1999
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
4 Sharply bounded alternation and quasilinear time – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1998
5 Sharply Bounded Alternation within P – Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith - 1996
2 Linear Logical Characterization of Polyspace Functions (Extended Abstract) – K. Terui, Kazushige Terui - 2000
Realizability and implicit PTIME characterization – Aloïs Brunel, Aloïs Brunel
1 Type Systems for Resource-Bounded Programming and Compilation: Case for Support – Martin Hofmann, David Aspinall
7 Feasible Computation With Higher Types – Helmut Schwichtenberg, Stephen J. Bellantoni - 2002