TYPE SYSTEMS FOR POLYNOMIAL-TIME COMPUTATION

[1]  Benjamin C. Pierce,et al.  Local type inference , 1998, POPL '98.

[2]  Martin Hofmann,et al.  A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion , 1997, CSL.

[3]  Gordon D. Plotkin,et al.  Type theory and recursion , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[4]  Philip Wadler,et al.  Once upon a type , 1995, FPCA '95.

[5]  Thomas Ehrhard,et al.  On strong stability and higher-order sequentiality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[7]  M. Hofmann,et al.  The groupoid interpretation of type theory , 1998 .

[8]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[9]  Vladimir Yu. Sazonov,et al.  A Construction of Typed Lambda Models Related to Feasible Computability , 1993, Kurt Gödel Colloquium.

[10]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space , 2000 .

[11]  Frank Pfenning,et al.  Primitive recursion for higher-order abstract syntax , 1997, Theoretical Computer Science.

[12]  Martin Hofmann,et al.  Linear types and non-size-increasing polynomial time computation , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[13]  S. Lane.  Categories for the Working Mathematician , 1971 .

[14]  Philip Wadler.  Is there a use for linear logic , 1991 .

[15]  Stephen A. Cook,et al.  Functional Interpretations of Feasibly Constructive Arithmetic , 1993, Ann. Pure Appl. Log..

[16]  F. Pfenning,et al.  On a Modal λ-Calculus for S41 1This work is supported by NSF Grant CCR-9303383 and the Advanced Research Projects Agency under ARPA Order No. 8313. , 1995 .

[17]  Jean-Yves Girard,et al.  Light Linear Logic , 1998, Inf. Comput..

[18]  Martin Hofmann.  An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras , 1997, Bull. Symb. Log..

[19]  Martin Hofmann,et al.  Syntax and semantics of dependent types , 1997 .

[20]  Richard Statman,et al.  The Typed lambda-Calculus is not Elementary Recursive , 1979, Theor. Comput. Sci..

[21]  B. Day.  An embedding theorem for closed categories , 1974 .

[22]  Benjamin C. Pierce,et al.  Bounded Quantification is Undecidable , 1994, Inf. Comput..

[23]  Frank Pfenning,et al.  On the Undecidability of Partial Polymorphic Type Reconstruction , 1993, Fundam. Informaticae.

[24]  Frank Pfenning,et al.  A modal analysis of staged computation , 1996, POPL '96.

[25]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space , 1994, CSL.