The expressive power of higher-order types or, life without CONS

Journal of Functional Programming

Volumn 11, Issue 1, 2001, Pages 55-94

  Jones, Neil D ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035635293     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003889     Document Type: Article

References (40)

1. Bellantoni, S. and Cook, S. (1992) A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2, 97-110.
2. Bellantoni, S., Niggl, K.-H. and Schwichtenberg, H. (1998) Characterising Polytime Through Higher Type Recursion. (Manuscript for the Dagstuhl Seminar 98 Programs: Improvements, Complexity and Meanings.)
3. Bird, R., Jones, G. and De Moor, O. (1997) More haste less speed: lazy versus eager evaluation. J. Functional Programming, 7(5), 541-547.
4. Cobham, A. (1964) The intrinsic computational difficulty of functions. Proc. Congress for Logic, Mathematics and Philosophy of Science, pp. 24-30.
5. Cook, S. A. (1971) Characterizations of pushdown machines in terms of time-bounded computers. J. ACM, 18, 4-18.
6. Crockett, R. and Spencer, D. (1992) Strong Categorical Datatypes I. In: R. A. G. Seely (ed.), International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings, AMS.
7. Girard, J.-Y. and Lafont, Y. and Taylor, P. (1989) Proofs and Types. Cambridge Tracts in Theoretical Computer Science, Vol. 7. Cambridge University Press.
8. Goerdt, A. (1992) Characterizing complexity classes by general recursive definitions in higher types. Infor. & Computation, 101, 201-218.
9. Goerdt, A. (1992) Characterizing complexity classes by higher type primitive recursive definitions. Theor. Comput. Sci. 101, 45-66.
10. Goerdt, A. and Seidl, H. (1990) Characterizing complexity classes by higher type primitive recursive definitions, Part II. Proc. 6th Int. Meeting for Young Computer Scientists: Lecture Notes in Computer Science 464, pp. 148-158. Springer-Verlag.
11. Grzegorczyk, A. (1953) Some classes of recursive functions. Rozprawy Matematik IV, Warsaw.
12. Gurevich, Y. (1983) Algebras of feasible functions. Proc. 24th Symposium on Foundations of Computer Science. IEEE Press, pp. 210-214.
13. Gurevich, Y. (1984) Towards logic tailored for computational complexity. Computation and Proof Theory: Lecture Notes in Mathematics 194, p. 99-117.
14. Hillebrand, G. (1994) Finite Model Theory in the Simply Typed Lambda Calculus. PhD thesis, Brown University.
15. Hillebrand, G. and Kanellakis, P. (1996) On the expressive power of simply typed and let-polymorphic lambda calculi. Proc. Logic in Computer Science. IEEE Press, pp. 253-263.
16. Hofmann, M. (1999) Type Systems for Polynomial-time Computation. Habilitationsschrift, Darmstadt. (Appeared as LFCS Technical Report ECS-LFCS-99-406, University of Edinburgh.)
17. Hutton, G. (1999) A tutorial on the universality and expressiveness of fold. J. Functional Programming, 9(4), 355-372.
18. Immerman, N. (1987) Expressibility as a complexity measure: results and directions. Proc. 2nd Conference on Structure in Complexity Theory. IEEE Press, pp. 223-257.
19. Jones, N. D. and Selman, A. (1974) Turing machines and the spectra of first-order formulae with equality. J. Symbolic Logic, 39(1), 139-150.
20. Jones, N. D. (1997) Computability and Complexity from a Programming Perspective. MIT Press.
21. Jones, N. D. (1999) LOGSPACE and PTIME characterized by programming languages. Theor. Comput. Sci. 228, 151-174.
22. Kfoury, A. (1997) Recursion versus iteration at higher-orders. Foundations of Software Technology and Theoretical Computer Science: Lecture Notes in Computer Science 1346, Kharagpur, India. Springer-Verlag.
23. Kfoury, A. (1999) Recursion, tail-recursion and iteration at higher-orders, (notes for a paper). Unpublished.
24. Kfoury, A. J., Tiuryn, J. and Urzyczyn, P. (1987) The hierarchy of functional programs. Proc. 2nd IEEE Symposium on Logic in Computer Science. IEEE Press, pp. 225-235.
25. Kfoury, A. J., Tiuryn, J. and Urzyczyn, P. (1992) On the expressive power of finitely typed and universally polymorphic recursive procedures. Theor. Comput. Sci. 93, 1-41.
26. Leivant, D. (1989) Descriptional characterizations of computational complexity classes. J. Computer & System Sciences, 39, 51-83.
27. Leivant, D. and Marion, J.-Y. (1993) Lambda calculus characterizations of poly-time. Fundamentae Informatica, 19, 167-184.
28. Leivant, D. and Marion, J.-Y. (2001) Ramified recurrence and computational complexity IV: predicative functionals and poly-space. Infor. & Computation, to appear.
29. Leivant, D. (1999) Applicative control and computational complexity. Unpublished manuscript.
30. Lloyd, J. (1999) Programming in an Integrated Functional and Logic Language. J. Functional and Logic Programming, 3.
31. Neergaard, P. (1999) Time analysis of lazy versus eager evaluation. DIKU Technical Report, University of Copenhagen.
32. Paterson, M. and Hewitt, C. (1970) Comparative schematology. MIT AI Lab Technical Memo no. 201. (Also in Proc. of Project MAC Conference on Concurrent Systems and Parallel Computation.)
33. Pippenger, N. (1996) Pure versus impure LISP. ACM Symposium on Principles of Programming Languages, pp. 104-109.
34. Savage, J. E. (1998) Models of Computation. Addison-Wesley.
35. Sazonov, V. (1980) Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik, 16, 319-323.
36. Schmidt, D. (1986) Denotational Semantics. Allyn and Bacon.
37. Turner, D. (1996) Elementary Strong Functional Programming. In: Plasmeijer, R. and Hartel, P. (eds.), First International Symposium on Functional Programming Languages in Education: Lecture Notes in Computer Science 1022, pp. 1-13. Springer-Verlag.
38. Winskel, G. (1986) The Formal Semantics of Programming Languages: An Introduction. MIT Press.
39. Voda, P. (1994) Subrecursion as a basis for a feasible programming language. Computer Science Logic: Lecture Notes in Computer Science 933, pp. 324-338. Springer-Verlag.
40. Voda, P. (1997) A simple ordinal recursive normalization of Gödel's T. Computer Science Logic: Lecture Notes in Computer Science 1414, p. 491-509. Springer-Verlag.