Nicholas Pippenger
- BEN-AMRAM, A. M. AND GALIL, Z. 1992. On pointers versus addresses. J. ACM 39, 617-648. Google Scholar
- BIRD, R., JONES, a., AND DE MOOR, O. 1997. More haste, less speed: Lazy versus eager evaluation. J. Funct. Program. To be published. Google Scholar
- CHURCH, A. 1941. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J. Google Scholar
- 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. Google Scholar
- FISCHER, P. C., MEYER, A. R., AND ROSENBERG, A.L. 1972. Real-time simulation of multihead tape units. J. ACM 19, 590-607. Google Scholar
- HOOD, R. AND MELVILLE, R. 1981. Real time queue operations in pure LISP. Inf. Proc. Lett. 13, 50-54.Google Scholar
- JIANG, T., SEIFERAS, g. I., AND VITANYI, P. M.B. 1994. Two heads are better than two tapes. In the ACM Symposium on Theory of Computing. ACM, New York, 668-675. Google Scholar
- KNUTH, D.E. 1968. The Art of Computer Programming. Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass. Google Scholar
- KOLMOGOROV, A. N. AND USPENSKI{, V.A. 1963. On the definition of an algorithm. AMS Transl. 2, 29, 217-245.Google Scholar
- MCCARTHY, J. 1960. Recursive functions of symbolic expressions and their computation by machine, Part I. Commun. ACM 3, 184-195. Google Scholar
- MCCARTHY, J. 1961. A basis for a mathematical theory of computation. In the Western Joint Computer Conference. AFIPS, 225-238.Google Scholar
- 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. Google Scholar
- MYERS, E.W. 1984. Efficient applicative data types. In Proceedings of the ACM Symposium on Principles of Programming Languages, ACM, New York, 66-75. Google Scholar
- PIPPENGER, N. 1996. Pure versus Impure Lisp. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 104-109. Google Scholar
- SCHONHAGE, A. 1980. Storage modification machines. SIAM J. Comput. 9, 490-508.Google Scholar
Index Terms
Pure versus impure Lisp
Recommendations
Standard LISP (reprint)
When it was first formulated in 1960, (1) the programming language LISP was a truly machine independent language. However, even the earliest computer implementation encountered problems in input-output control and the handling of free variables which ...
On compiling embedded languages in LISP
LFP '80: Proceedings of the 1980 ACM conference on LISP and functional programmingIn INTERLISP we find a number of embedded languages such as the iterative statement and the pattern match facility in the CLISP package, the editor and makefile languages and so forth. We will in this paper concentrate on the problem of extending the ...
Reviews
Zoran D. Budimac
Pippenger compares pure to impure LISP with respect to program complexity. Impure LISP is defined as the form of LISP that has rplaca and rplacd primitives (or their equivalents) for destructive replacement of the list head and list tail with new values. The author considers only symbolic and online computations. The paper answers the question of whether every impure LISP program that transforms a word over a finite alphabet into a B oolean value can be transformed into an equivalent pure LISP program in such a way that the number of executed primitives in the pure LISP program is larger by a constant value than the number of executed primitives in the impure LISP program. The main result of the paper is stated in Theorem 1.1, which states that there is a symbolic online computation that can be performed by an impure LISP program with at most O n primitive operations for the first n outputs, but for which every pure LISP program, for some input sequences, performs at least G n log n primitive operations. G f n is a function bounded below by a positive constant multiple of f n . The paper is well written and easy to follow. Proofs of some theorems are done by a simple Scheme program, which makes the paper even more interesting.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments