Listlessness is better than laziness

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time

Full text

Pdf (539 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 45 - 52

Year of Publication: 1984

ISBN:0-89791-142-3

Author

Philip Wadler

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 27, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/800055.802020 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	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	2	Robert S. Boyer , J. Strother Moore, Proving Theorems about LISP Functions, Journal of the ACM (JACM), v.22 n.1, p.129-144, Jan. 1975 [doi>10.1145/321864.321875]
	3	Boyer, R. S., and Moore, J. S. A Computational Logic. Academic Press, New York, 1979.
	4	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	5	Clark, K., and Darlington, J. Algorithm classification through synthesis. Computer Journal, 23(1):61-65, February, 1980.
	6	Martin S. Feather, A System for Assisting Program Transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.1-20, Jan. 1982 [doi>10.1145/357153.357154]
	7	Robert W. Floyd, The paradigms of programming, Communications of the ACM, v.22 n.8, p.455-460, Aug. 1979 [doi>10.1145/359138.359140]
	8	Friedman, D. P., and Wise, D. S. Cons should not evaluate its arguments. In Michaelson and Milner (editors), Automata, Languages, and Programming, 257-284, Edinburgh University Press, 1976.
	9	Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
	10	Hughes, J. M. The design and implementation of programming languages. D.Phil. Thesis, Oxford University, 1984.
	11	Richard B. Kieburtz , Jonathan Shultis, Transformations of FP program schemes, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.41-48, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806761]
	12	Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974 [doi>10.1145/356635.356640]
	13	Robert Kowalski, Algorithm = logic + control, Communications of the ACM, v.22 n.7, p.424-436, July 1979 [doi>10.1145/359131.359136]
	14	Lesk, M. E. Lex - a lexical analyzer generator. Technical report, Bell Labs, Murray Hill, NJ, 1975.
	15	Manna, Z., and Waldinger, R. Synthesis: Dreams &equil;> Programs. IEEE Trans. Software Engineering, SE-5(4):157-164, July, 1979.
	16	Michael S. Paterson , Carl E. Hewitt, Comparative Schematology, Massachusetts Institute of Technology, Cambridge, MA, 1970
	17	Dennis M. Ritchie , Ken Thompson, The UNIX time-sharing system, Communications of the ACM, v.17 n.7, p.365-375, July 1974 [doi>10.1145/361011.361061]
	18	William L. Scherlis, Program improvement by internal specialization, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.41-49, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567536]
	19	Guy Lewis Steele, Jr., Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO, Proceedings of the 1977 annual conference, p.153-162, January 1977 [doi>10.1145/800179.810196]
	20	Turner, D. A. Recursion equations as a programming language. In Darlington, et al (editors), Functional Programming and Its Applications, Cambridge University Press, 1981.
	21	Valentin F. Turchin , Robert M. Nirenberg , Dimitri V. Turchin, Experiments with a supercompiler, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.47-55, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802134]
	22	Philip Wadler, Applicative style programming, program transformation, and list operators, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.25-32, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806759]
	23	Philip Lee Wadler, Listlessness is better than laziness: an algorithm that transforms applicative programs to eliminate intermediate lists, 1984
	24	An improved Prolog implemenation which optimizes tail-recursion. Dept. of AI Research Report 141, University of Edinburgh, 1980.
	25	Waters, R. C. A method for analyzing loop programs. IEEE Trans. on Software Engineering, SE-5(3):237-247, May, 1979.

CITED BY 16

	Todd A. Proebsting , Scott A. Watterson, Filter fusion, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-130, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Mads Rosendahl, Simple driving techniques, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	John Launchbury , Tim Sheard, Warm fusion: deriving build-catas from recursive definitions, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.314-323, June 26-28, 1995, La Jolla, California, United States
	Wei-Ngan Chin, Safe fusion of functional expressions, ACM SIGPLAN Lisp Pointers, v.V n.1, p.11-20, Jan. 1992
	Tim Sheard , Leonidas Fegaras, A fold for all seasons, Proceedings of the conference on Functional programming languages and computer architecture, p.233-242, June 09-11, 1993, Copenhagen, Denmark
	Kimberley Burchett , Gregory H. Cooper , Shriram Krishnamurthi, Lowering: a static optimization technique for transparent functional reactivity, Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 15-16, 2007, Nice, France
	Andrew Berlin, Partial evaluation applied to numerical computation, Proceedings of the 1990 ACM conference on LISP and functional programming, p.139-150, June 27-29, 1990, Nice, France
	R. C. Waters, Efficient interpretation of synchronizable series expressions, ACM SIGPLAN Notices, v.22 n.7, p.74-85, July 1987
	Limsoon Wong, Normal forms and conservative properties for query languages over collection types, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.26-36, May 25-28, 1993, Washington, D.C., United States
	Lukasz Ziarek , Stephen Weeks , Suresh Jagannathan, Flattening tuples in an SSA intermediate representation, Higher-Order and Symbolic Computation, v.21 n.3, p.333-358, September 2008
	Paul Caspi , Marc Pouzet, Synchronous Kahn networks, ACM SIGPLAN Notices, v.31 n.6, p.226-238, June 15, 1996
	Josef Svenningsson, Shortcut fusion for accumulating parameters & zip-like functions, ACM SIGPLAN Notices, v.37 n.9, p.124-132, September 2002
	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989
	Franklyn Turbak, First-class synchronization barriers, ACM SIGPLAN Notices, v.31 n.6, p.157-168, June 15, 1996
	Richard C. Waters, Automatic transformation of series expressions into loops, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.52-98, Jan. 1991
	Ole Agesen , David Detlefs , J. Eliot Moss, Garbage collection and local variable type-precision and liveness in Java virtual machines, ACM SIGPLAN Notices, v.33 n.5, p.269-279, May 1998

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.2 ARTIFICIAL INTELLIGENCE
I.2.2 Automatic Programming
Subjects: Program transformation

Additional Classification:
D. Software
D.3 PROGRAMMING LANGUAGES
D.3.2 Language Classifications

Nouns: FP
D.3.4 Processors
Subjects: Memory management (garbage collection)

General Terms:
Languages, Performance

Collaborative Colleagues:

Philip Wadler: colleagues

Peer to Peer - Readers of this Article have also read:

Constructing reality Proceedings of the 11th annual international conference on Systems documentation
Douglas A. Powell , Norman R. Ball , Mansel W. Griffiths
Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein

Adobe Acrobat

QuickTime

Windows Media Player

Real Player