An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras

Bulletin of Symbolic Logic

Volumn 3, Issue 4, 1997, Pages 469-486

  Hofmann, Martin ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012944527     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421100     Document Type: Article

References (15)

1. STEPHEN BELLANTONI and STEPHEN COOK, New recursion-theoretic characterization of the polytime functions, Computational Complexity, vol. 2 (1992), pp. 97-110.
2. SAMUEL R. BUSS, Bounded arithmetic, Bibliopolis, 1986.
3. S. COOK and A. URQUHART, Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic, vol. 63 (1993), pp. 103-200.
4. J. DESPEYROUX, F. PFENNING, and C. SCHÜRMANN, Primitive recursion for higher-order abstract syntax, Technical Report CMU-CS-96-172, Carnegie Mellon University, 1996.
5. THOMAS EHRHARD and LOÏC COLSON, On strong stability and higher-order sequentiality, Proceedings of the 9th symposium logic in computer science (LICS), Paris, France, IEEE, 1994, pp. 103-109.
6. VICTOR HARNIK, Provably total functions of intuitionistic bounded arithmetic, Journal of Symbolic Logic, vol. 57 (1992), no. 2, pp. 466-477.
7. MARTIN HOFMANN, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, presented at Computer Science Logic '97, Aarhus, Denmark, submitted to the Proceedings.
8. ACHIM JUNG, and JERZY TIURYN, A new characterisation of lambda definability, Typed lambda calculi and applications (TLCA '93) (M. Bezem and J. F. Groote, editors), Springer Lecture Notes in Computer Science, vol. 664, 1993, pp. 245-257.
9. JOACHIM LAMBEK and PHILIP SCOTT, Introduction to higher-order categorical logic, Cambridge University Press, 1986.
10. DANIEL LEIVANT and JEAN-YVES MARION, Ramified recurrence and computational complexity IV: Predicative functionals and poly-space, 1997, manuscript.
11. S. MAZUR, Computable analysis, Rozprawy Matematycine, vol. 33 (1963).
12. IEKE MOERDIJK and SAUNDERS MAC LANE, Sheaves in geometry and logic. A first introduction to topos theory, Springer-Verlag, 1992.
13. PHILIP S. MULRY, The topos of recursive sets, Ph.D. thesis, State University of New York at Buffalo, 1980.
14. JIM OTTO, Complexity doctrines, Ph.D. thesis, McGill University, 1995.
15. R. STATMAN, Logical relations and the typed λ-calculus, Information and Control, vol. 65 (1985), pp. 85-97.