A model for comparing the space usage of lazy evaluators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A model for comparing the space usage of lazy evaluators

Full text

Pdf (444 KB)

Source

International Conference on Principles and Practice of Declarative Programming archive
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming table of contents

Montreal, Quebec, Canada

Pages: 151 - 162

Year of Publication: 2000

ISBN:1-58113-265-4

Authors

Adam Bakewell	Department of Computer Science, University of York, UK.
Colin Runciman	Department of Computer Science, University of York, UK.

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 2

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/351268.351287 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	Samson Abramsky, The lazy lambda calculus, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	2	Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
	3	Zena M. Ariola , Arvind, Properties of a first-order functional language with sharing, Theoretical Computer Science, v.146 n.1-2, p.69-108, July 24, 1995 [doi>10.1016/0304-3975(94)00185-L]
	4	Adam Bakewell , Colin Runciman, The space usage problem: An evaluation kit for graph reduction semantics, Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00), p.115-128, July 26-28, 2000
	5	D. R. Chase, Safety consideration for storage allocation optimizations, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.1-10, June 20-24, 1988, Atlanta, Georgia, United States
	6	William D. Clinger, Proper tail recursion and space efficiency, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.174-185, June 17-19, 1998, Montreal, Quebec, Canada
	7	H. Ehrig , G. Engels , H.-J. Kreowski , G. Rozenberg, Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools, World Scientific Publishing Co., Inc., River Edge, NJ, 1999
	8	Andrew D. Gordon, Functional programming and input/output, Cambridge University Press, New York, NY, 1994
	9	A. D. Gordon. A tutorial on co-induction and functional programming. In Glasgow Workshop on Functional Programming, pages 78{95. Springer, September 1994.
	10	J. Gustavsson and D. Sands. A foundation for spacesafe transformations of call-by-need programs. In The 3rd International Workshop on Higher Order Operational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999.
	11	D. Howe, Equality in lazy computation systems, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.198-203, June 1989, Pacific Grove, California, United States
	12	J. Hughes. Lazy memo-functions. Technical Report 21, Chalmers Programming Methodology Group, September 1985.
	13	R. Jones. Tail recursion without space leaks. Journal of Functional Programming, 2(1):73{80, January 1992.
	14	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	15	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	16	Greg Morrisett , Matthias Felleisen , Robert Harper, Abstract models of memory management, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.66-77, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224182]
	17	Jon Mountjoy, The spineless tagless G-machine, naturally, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.163-173, September 26-29, 1998, Baltimore, Maryland, United States
	18	Hanne Riis Nielson , Flemming Nielson, Semantics with applications: a formal introduction, John Wiley & Sons, Inc., New York, NY, 1992
	19	S. L. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, 1987.
	20	Niklas Röjemo , Colin Runciman, Lag, drag, void and use—heap profiling and space-efficient compilation revisited, Proceedings of the first ACM SIGPLAN international conference on Functional programming, p.34-41, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	21	K. H. Rose. Operational Reduction Models for Functional Programming Languages. PhD thesis, DIKU, University of Copenhagen, February 1996.
	22	C. Runciman and D. Wakeling. Heap pro~ling of lazy functional programs. Journal of Functional Programming, 3(2):217{246, April 1993.
	23	Peter Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming, v.7 n.3, p.231-264, May 1997 [doi>10.1017/S0956796897002712]
	24	Jan Sparud, Fixing some space leaks without a garbage collector, Proceedings of the conference on Functional programming languages and computer architecture, p.117-122, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165196]
	25	Philip Wadler, Fixing some space leaks with a garbage collector, Software—Practice & Experience, v.17 n.9, p.595-608, September 1, 1987 [doi>10.1002/spe.4380170904]

CITED BY 2

	Jörgen Gustavsson , David Sands, Possibilities and limitations of call-by-need space improvement, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Hai Liu , Paul Hudak, Plugging a Space Leak with an Arrow, Electronic Notes in Theoretical Computer Science (ENTCS), 193, p.29-45, November, 2007