Safe recursion with higher types and BCK-algebra

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 113-166

  Hofmann, Martin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Polynomial time; Realisability; Type systems

Indexed keywords

EID: 0000201517     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00010-5     Document Type: Article

References (20)

1. S. Bellantoni, K.-H. Niggl, H. Schwichtenberg, Ramification, modality, and linearity in higher type recursion, Ann. Pure Appl. Logic (2000) this volume.
2. S. Bellantoni, S. Cook, New recursion-theoretic characterization of the polytime functions, Comput. Complexity 2 (1992) 97-110.
3. V.-H. Caseiro, Equations for defining poly-time functions, Ph.D. Thesis, University of Oslo, 1997. Available by ftp from ftp.ifi.uio.no/pub/vuokko/0adm.ps.
4. P. Clote, Computation models and function algebras, available electronically under http://thelonius.tcs.informatik.uni-muenchen.de/ ~clote/Survey.ps.gz, 1996.
5. A. Cobham, The intrinsic computational difficulty of functions, in: Y. Bar-Hillel (Ed.), Logic, Methodology, and Philosophy of Science II, Springer, Berlin, 1965, pp. 24-30.
6. B.J. Day, in: An embedding theorem for closed categories, in Category Seminar Sydney 1972-73, Lecture Notes in Mathematics, vol. 420, Springer, Berlin, 1974.
7. M. Hofmann, An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras, Bull. Symb. Logic 3 (4) (1997) 469-485.
8. M. Hofmann, Extensional Constructs in Intensional Type Theory, BCS Distinguished Dissertation Series, Springer, Berlin, 1997, 214 pp.
9. M. Hofmann, Syntax and semantics of dependent types, in: A.M. Pitts, P. Dybjer (Eds.), Semantics and Logics of Computation, Publications of the Newton Institute, Cambridge University Press, Cambridge, UK, 1997.
10. M. Hofmann, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, in Proc. CSL '97, Aarhus, Lecture Notes in Computer Science, vol. 1414, Springer, Berlin, 1998, pp. 275-294.
11. M. Hofmann, Semantics of linear/modal lambda calculus, J. Funct. Programm. 9(3) (1999) 247-277.
12. Martin Hofmann, Linear types and non size-increasing polynomial time computation, in Logic in Computer Science (LICS), IEEE Computer Society Press, Silverspring, MD, 1999, pp. 204-213.
13. M. Hofmann, Type systems for polynomial-time computation, 1999. Habilitation Thesis, TU Darmstadt, Germany. Edinburgh University LFCS Technical Report, ECS-LFCS-99-406.
14. J. Lambek, P. Scott, Introduction to Higher-Order Categorical Logic, Cambridge University Press, Cambridge, UK, 1986.
15. D. Leivant, J.-Y. Marion, Lambda calculus characterisations of polytime, Fund. Inform. 19 (1993) 167-184.
16. D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity II: Substitution and poly-space, in: J. Tiuryn, L. Pacholski (Eds.), Proc. CSL '94, Kazimierz, Poland, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995, pp. 486-500.
17. D. Leivant, J.-Y. Marion, Predicative functional recurrence and Poly-space, in: Proc. CAAP 1997, Springer LNCS, 1214.
18. S. Mac Lane, Categories for the Working Mathematician, Springer, Berlin, 1971.
19. F. Pfenning, H.-C. Wong, in: On a modal lambda calculus for S4, in: Proc. 11th Conf. on Mathematical Foundations of Programming Semantics (MFPS), New Orleans, Louisiana, Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier, Amsterdam, 1995.
20. R. Statman, Logical relations and the typed λ-calculus, Inform. Control 65 (1985) 85-97.