Pure versus impure Lisp

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pure versus impure Lisp

Full text

Pdf (613 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

St. Petersburg Beach, Florida, United States

Pages: 104 - 109

Year of Publication: 1996

ISBN:0-89791-769-3

Author

Nicholas Pippenger

Department of Computer Science, The University of British Columbia, Vancouver, BC V6T 1Z4, Canada

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 15, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237721.237741 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Amir M. Ben-Amram , Zvi Galil, On pointers versus addresses, Journal of the ACM (JACM), v.39 n.3, p.617-648, July 1992 [doi>10.1145/146637.146666]
	2	Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985
	3	Patrick C. Fischer , Albert R. Meyer , Arnold L. Rosenberg, Real-Time Simulation of Multihead Tape Units, Journal of the ACM (JACM), v.19 n.4, p.590-607, Oct. 1972 [doi>10.1145/321724.321726]
	4	F. C. Hennie, "On-Line Turing Machine Computations", IEEE Trans. on Electron. Computers, 15 (1966) 34-44.
	5	R. Hood and R. Melville, "Real Time Queue Operations in Pure LISP", Info. Proc. Lelt., 13 (1981) 50-54.
	6	A. N. Kolmogorov and V. A. UspenskiY, "On the Definition of an Algorithm", AMS Translations (2), 29 (1963) 217-245.
	7	John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
	8	John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
	9	M. S. Paterson and C. E. Hewitt, "Comparative Schematology", Project MAC Conf. on Concurrent Systems and Parallel Computation, (1970) 119- 128.
	10	Nicholas Pippenger, Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.351-356, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804684]
	11	Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986 [doi>10.1145/6138.6151]
	12	A. SchSnhage, "Storage Modification Machines", SIAM J. Comput., 9 (1980) 490-508.
	13	R. E. Tarjan, "A Class of Algorithms That Require Nonlinear Time to Maintain Disjoint Sets", J. Comput. and Sys. Sci., 18 (1979) 110-127.

CITED BY 3

	Nicholas Pippenger, Pure versus impure Lisp, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.2, p.223-238, March 1997
	Richard Bird , Geraint Jones , Oege De Moor, More haste, less speed: lazy versus eager evaluation, Journal of Functional Programming, v.7 n.5, p.541-547, September 1997
	Neil D. Jones, The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, v.11 n.1, p.55-94, January 2001