Compile-time garbage collection by sharing analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compile-time garbage collection by sharing analysis

Full text

Pdf (1.49 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the fourth international conference on Functional programming languages and computer architecture table of contents

Imperial College, London, United Kingdom

Pages: 54 - 74

Year of Publication: 1989

ISBN:0-89791-328-0

Authors

Simon B. Jones	Dept. of Computing Science, University of Stirling, Scotland
Daniel Le Métayer	IRISA/INRIA, 35042 RENNES, France

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 25, Citation Count: 24

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/99370.99375 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.

	Abramsky87	S. Abramsky , C. Hankin, Abstract interpretation of declarative languages, Halsted Press, New York, NY, 1987
	Barth77	Jeffrey M. Barth, Shifting garbage collection overhead to compile time, Communications of the ACM, v.20 n.7, p.513-518, July 1977 [doi>10.1145/359636.359713]
	Burstall77	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]
	Hudak87	Hudak P, "A semantic model of reference counting and its abstraction", in {Abramsky87}.
	Hughes87	Hughes J, "Backwards analysis of functional programs", University of Glasgow, Dept of Computing Science, ~h report CSC/87~3, March 1987.
	Inoue88	Katsuro Inoue , Hiroyuki Seki , Hikaru Yagi, Analysis of functional programs to detect run-time garbage cells, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.555-578, Oct. 1988 [doi>10.1145/48022.48025]
	Jones89	Jones S B, Le M6tayer D, "A new method for stricmess analysis on non-flat domains", INRIA research ~pon (to appear).
	Meira84	Silvio Romero de Lemos Meira, Optimized Combinatoric Code for Applicative Language Implementation, Proceedings of the 6th Colloquium on International Symposium on Programming, p.206-216, April 17-19, 1984
	Schwarz78	Schwarz J, "Verifying the safe use of destructive operations in applicative programs", Proceedings of 3rd International Symposium on Programming, 1978, Dunod informatique.
	Stoye84	W. R. Stoye , T. J. W. Clarke , A. C. Norman, Some practical methods for rapid combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.159-166, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802032]
	Wadler87	Philip Wadler , R. J. M. Hughes, Projections for strictness analysis, Proc. of a conference on Functional programming languages and computer architecture, p.385-407, October 1987, Portland, Oregon, United States
	Wadler88	Philip Wadler, Deforestation: transforming programs to eliminate trees, Proceedings of the Second European Symposium on Programming, p.231-248, January 1988, Nancy, France

CITED BY 24

	Henry G. Baker, Unify and conquer, Proceedings of the 1990 ACM conference on LISP and functional programming, p.218-226, June 27-29, 1990, Nice, France
	Alan Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-168, December 1989, San Francisco, California, United States
	Gudjón Gudjónsson , William H. Winsborough, Compile-time memory reuse in logic programming languages through update in place, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.3, p.430-501, May 1999
	David J. Roth , David S. Wise, One-bit counts between unique and sticky, ACM SIGPLAN Notices, v.34 n.3, p.49-56, March 1999
	Peter Thiemann, A safety analysis for functional languages, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.133-144, June 14-16, 1993, Copenhagen, Denmark
	Pascal Fradet, Collecting more garbage, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.24-33, July-Sept. 1994
	Young Gil Park , Benjamin Goldberg, Escape analysis on lists, ACM SIGPLAN Notices, v.27 n.7, p.116-127, July 1992
	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
	Marc Neuberger , Prateek Mishra, A precise relationship between the deductive power of forward and backward strictness analysis, ACM SIGPLAN Lisp Pointers, v.V n.1, p.127-138, Jan. 1992
	Yanhong A. Liu , Tim Teitelbaum, Caching intermediate results for program improvement, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.190-201, June 21-23, 1995, La Jolla, California, United States
	Yanhong A. Liu , Scott D. Stoller, From recursion to iteration: what are the optimizations?, ACM SIGPLAN Notices, v.34 n.11, p.73-82, Nov. 1999
	Leena Unnikrishnan , Scott D. Stoller , Yanhong A. Liu, Automatic Accurate Live Memory Analysis for Garbage-Collected Languages, ACM SIGPLAN Notices, v.36 n.8, p.102-111, Aug. 2001
	Alain Deutsch, On the complexity of escape analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 15-17, 1997, Paris, France
	Young Gil Park , Benjamin Goldberg, Reference escape analysis: optimizing reference counting based on the lifetime of references, ACM SIGPLAN Notices, v.26 n.9, p.178-189, Sept. 1991
	Benjamin Goldberg , Michael Gloger, Polymorphic type reconstruction for garbage collection without tags, ACM SIGPLAN Lisp Pointers, v.V n.1, p.53-65, Jan. 1992
	Yanhong A. Liu , Scott D. Stoller, Eliminating dead code on recursive data, Science of Computer Programming, v.47 n.2-3, p.221-242, May 2003
	Sebastian Hunt , David Sands, Binding time analysis: a new PERspective, ACM SIGPLAN Notices, v.26 n.9, p.154-165, Sept. 1991
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Static caching for incremental computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.3, p.546-585, May 1998
	Melissa E. O'Neill , F. Warren Burton, Smarter garbage collection with simplifiers, Proceedings of the 2006 workshop on Memory system performance and correctness, October 22-22, 2006, San Jose, California
	Samuel Z. Guyer , Kathryn S. McKinley , Daniel Frampton, Free-Me: a static analysis for automatic individual object reclamation, ACM SIGPLAN Notices, v.41 n.6, June 2006
	M. Alpuente , S. Escobar , S. Lucas, Removing redundant arguments automatically, Theory and Practice of Logic Programming, v.7 n.1-2, p.3-35, January 2007
	Jurriaan Hage , Stefan Holdermans, Heap recycling for lazy languages, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
	David A. Schmidt, Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, v.10 n.3, p.237-271, May 1998
	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992