Minimizing reference count updating with deferred and anchored pointers for functional data structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimizing reference count updating with deferred and anchored pointers for functional data structures

Full text

Pdf (665 KB)

Source

ACM SIGPLAN Notices archive
Volume 29 , Issue 9 (September 1994) table of contents

Pages: 38 - 43

Year of Publication: 1994

ISSN:0362-1340

Author

Henry G. Baker

Nimble Computer Corporation, 16231 Meadow Ridge Way, Encino, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 18, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/185009.185016 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, Computational interpretations of linear logic, Theoretical Computer Science, v.111 n.1-2, p.3-57, April 12, 1993 [doi>10.1016/0304-3975(93)90181-R]
	2	Henry G. Baker, CONS should not CONS its arguments, or, a lazy alloc is a smart alloc, ACM SIGPLAN Notices, v.27 n.3, p.24-34, March 1992 [doi>10.1145/130854.130858]
	3	Henry G. Baker, The treadmill: real-time garbage collection without motion sickness, ACM SIGPLAN Notices, v.27 n.3, p.66-70, March 1992 [doi>10.1145/130854.130862]
	4	Henry G. Baker, The Boyer Benchmark at warp speed, ACM SIGPLAN Lisp Pointers, v.V n.3, p.13-14, July-Sept. 1992 [doi>10.1145/147135.147137]
	5	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992 [doi>10.1145/142137.142162]
	6	Henry G. Baker, Safe and leakproof resource management using Ada83 limited types, ACM SIGAda Ada Letters, v.XIII n.5, p.32-42, Sept./Oct. 1993 [doi>10.1145/165354.165362]
	7	Henry G. Baker, Equal rights for functional objects or, the more things change, the more they are the same, ACM SIGPLAN OOPS Messenger, v.4 n.4, p.2-27, Oct. 1993 [doi>10.1145/165593.165596]
	8	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]
	9	Proceedings of the International Workshop on Memory Management, September 1992
	10	Gérard Berry , Gérard Boudol, The chemical abstract machine, Theoretical Computer Science, v.96 n.1, p.217-248, 6 April 1992
	11	Boehm, H.-J. "Simple GC-Safe Compilation". GC Workshop at OOPSLA'91, Phoenix, AZ, Oct. 6, 1991.
	12	Chikayama, T., and Kimuar, Y. "Multiple Reference Management in Flat GHC". Logic Programming, Proc. 4th Intl. Conf., MIT Press, 1987, 276-293.
	13	Jawahar Chirimar , Carl A. Gunter , Jon G. Riecke, Proving memory management invariants for a language based on linear logic, Proceedings of the 1992 ACM conference on LISP and functional programming, p.139-150, June 22-24, 1992, San Francisco, California, United States
	14	George E. Collins, A method for overlapping and erasure of lists, Communications of the ACM, v.3 n.12, p.655-657, Dec. 1960 [doi>10.1145/367487.367501]
	15	L. Peter Deutsch , Daniel G. Bobrow, An efficient, incremental, automatic garbage collector, Communications of the ACM, v.19 n.9, p.522-526, Sept. 1976 [doi>10.1145/360336.360345]
	16	L. Peter Deutsch, ByteLisp and its Alto implementation, Proceedings of the 1980 ACM conference on LISP and functional programming, p.231-242, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802811]
	17	Amer Diwan , Eliot Moss , Richard Hudson, Compiler support for garbage collection in a statically typed language, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.273-282, June 15-19, 1992, San Francisco, California, United States
	18	Edelson, D.R. "Smart pointers: They're smart but they're not pointers". Proc. Usenix C++ Tech. Conf. 92, 1-19.
	19	Daniel R. Edelson, Precompiling C++ for Garbage Collection, Proceedings of the International Workshop on Memory Management, p.299-314, September 17-19, 1992
	20	A. W. Appel , J. R. Ellis , K. Li, Real-time concurrent collection on stock multiprocessors, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.11-20, June 20-24, 1988, Atlanta, Georgia, United States
	21	Friedman, D.P., and Wise, D.S. "Aspects of applicative programming for parallel processing". IEEE Trans. Comput. C-27, 4 (Apr. 1978), 289-296.
	22	Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
	23	H. Gelernter , J. R. Hansen , C. L. Gerberich, A Fortran-Compiled List-Processing Language, Journal of the ACM (JACM), v.7 n.2, p.87-101, April 1960 [doi>10.1145/321021.321022]
	24	Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
	25	B. Goldberg, Generational reference counting: a reduced-communication distributed storage reclamation scheme, ACM SIGPLAN Notices, v.24 n.7, p.313-321, July 1989
	26	Inamura, Y., et al. "Optimization Techniques Using the MRB and Their Evaluation on the Multi-PSI/V2". Logic Programming, Proc. North American Conf., MIT Press, 1989, 907-921.
	27	Richard B. Kieburtz, Programming without pointer variables, Proceedings of the 1976 conference on Data : Abstraction, definition and structure, p.95-107, March 22-24, 1976, Salt Lake City, Utah, United States
	28	Y. Lafont, The linear abstract machine, Theoretical Computer Science, v.59 n.1-2, p.157-180, July 1988 [doi>10.1016/0304-3975(88)90100-4]
	29	M. Lemaître , M. Castan , M.-H. Durand , G. Durrieu , B. Lecussan, Mechanisms for efficient multiprocessor combinator reduction, Proceedings of the 1986 ACM conference on LISP and functional programming, p.113-121, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319855]
	30	K. Nilsen, Garbage collection of strings and linked data structures in real time, Software—Practice & Experience, v.18 n.7, p.613-640, July 1988 [doi>10.1002/spe.4380180704]
	31	Kenji Nishida , Yasunori Kimura , Akira Matsumoto , Atsuhiro Goto, Evaluation of MRB garbage collection parallel logic programming architectures, Logic programming, MIT Press, Cambridge, MA, 1990
	32	Young Gil Park , Benjamin Goldberg, Reference escape analysis: optimizing reference counting based on the lifetime of references, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.178-189, June 17-19, 1991, New Haven, Connecticut, United States
	33	Shalit, A. Dylan^TM. An object-oriented dynamic language. Apple Computer, Camb., MA, 1992.
	34	Steele, G.L. "Fast Arithmetic in MacLisp". AI Memo 421, MIT AI Lab., Camb., MA, Sept. 1977.
	35	Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
	36	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]
	37	Robert E. Strom, Mechanisms for compile-time enforcement of security, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.276-284, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567093]
	38	R E Strom , S Yemini, Typestate: A programming language concept for enhancing software reliability, IEEE Transactions on Software Engineering, v.12 n.1, p.157-171, Jan. 1986
	39	Philip Wadler, Is there a use for linear logic?, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.255-273, June 17-19, 1991, New Haven, Connecticut, United States
	40	David Wakeling , Colin Runciman, Linearity and Laziness, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, p.215-240, August 26-30, 1991
	41	Wise, D.S., and Friedman, D.P. "The one-bit reference count". BIT 17, 3 (Sept. 1977), 351-359.
	42	Wise, D.S. "Stop-and-copy and One-bit Reference Counting". TR-360, Indiana U., Bloomington, IN, Oct. 1992.
	43	Taiichi Yuasa, Design and implementation of Kyoto Common Lisp, Journal of Information Processing, v.13 n.3, p.284-295, 1990

CITED BY 4

	Yossi Levanoni , Erez Petrank, An on-the-fly reference counting garbage collector for Java, ACM SIGPLAN Notices, v.36 n.11, p.367-380, 11/01/2001
	Yossi Levanoni , Erez Petrank, An on-the-fly reference-counting garbage collector for java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.1, p.1-69, January 2006
	Henry G. Baker, “Use-once” variables and linear objects: storage management, reflection and multi-threading, ACM SIGPLAN Notices, v.30 n.1, p.45-52, Jan. 1995
	Pramod G. Joisha, Compiler optimizations for nondeferred reference: counting garbage collection, Proceedings of the 2006 international symposium on Memory management, June 10-11, 2006, Ottawa, Ontario, Canada