Pure versus Impure Lisp

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 2, 1997, Pages 223-238

  Pippenger, Nicholas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

D.3.3 Programming Languages : Language Constructs and Features Lisp; F.3.3 Logics and Meanings of Programs : Studies of Program Constructs program and recursion schemes; Languages; Online computation; Schematology; Theory

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; PROGRAM DIAGNOSTICS; RECURSIVE FUNCTIONS;

ONLINE COMPUTATION;

LISP (PROGRAMMING LANGUAGE);

EID: 0031100714     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/244795.244798     Document Type: Article

References (15)

1. BEN-AMRAM, A. M. AND GALIL, Z. 1992. On pointers versus addresses. J. ACM 39, 617-648.
2. BIRD, R., JONES, G., AND DE MOOR, O. 1997. More haste, less speed: Lazy versus eager evaluation. J. Funct. Program. To be published.
3. CHURCH, A. 1941. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J.
4. DRISCOLL, J. R., SARNAK, N., SLEATOR, D. D., AND TARJAN, R. E. 1986. Making data structures persistent. In the ACM Symposium on Theory of Computing. ACM, New York, 109-121.
5. FISCHER, P. C., MEYER, A. R., AND ROSENBERG, A. L. 1972. Real-time simulation of multihead tape units. J. ACM 19, 590-607.
6. HOOD, R. AND MELVILLE, R. 1981. Real time queue operations in pure LISP. Inf. Proc. Lett. 13, 50-54.
7. JIANG, T., SEIFERAS, J. I., AND VITÁNYI, P. M. B. 1994. Two heads are better than two tapes. In the ACM Symposium on Theory of Computing. ACM, New York, 668-675.
8. KNUTH, D. E. 1968. The Art of Computer Programming. Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass.
9. KOLMOGOROV, A. N. AND USPENSKIǏ, V. A. 1963. On the definition of an algorithm. AMS Transl. 2, 29, 217-245.
10. MCCARTHY, J. 1960. Recursive functions of symbolic expressions and their computation by machine, Part I. Commun. ACM 3, 184-195.
11. MCCARTHY, J. 1961. A basis for a mathematical theory of computation. In the Western Joint Computer Conference. AFIPS, 225-238.
12. MCCARTHY, J., ABRAHAMS, P. W., EDWARDS, D. J., HART, T. P., AND LEVIN, M. I. 1962. Lisp 1.5 Programmer's Manual. MIT Press, Cambridge, Mass.
13. MYERS, E. W. 1984. Efficient applicative data types. In Proceedings of the ACM Symposium on Principles of Programming Languages, ACM, New York, 66-75.
14. PIPPENGER, N. 1996. Pure versus Impure Lisp. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 104-109.
15. SCHÖNHAGE, A. 1980. Storage modification machines. SIAM J. Comput. 9, 490-508.