{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:33:33Z","timestamp":1693866813441},"reference-count":25,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90103-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"243-249","source":"Crossref","is-referenced-by-count":8,"title":["Stop-and-copy and one-bit reference counting"],"prefix":"10.1016","volume":"46","author":[{"given":"David S.","family":"Wise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90103-G_BIB1","series-title":"OOPSLA '91 GC Workshop","article-title":"Cache-conscious copying collectors","author":"Baker","year":"1991"},{"issue":"3","key":"10.1016\/0020-0190(93)90103-G_BIB2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/130854.130858","article-title":"CONS should not CONS its arguments","volume":"27","author":"Baker","year":"1992","journal-title":"SIGPLAN Notices"},{"issue":"8","key":"10.1016\/0020-0190(93)90103-G_BIB3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/142137.142162","article-title":"Lively linear lisp - \u2018Look Ma, no garbage!\u2019","volume":"27","author":"Baker","year":"1992","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0020-0190(93)90103-G_BIB4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/359636.359713","article-title":"Shifting garbage collection overhead to compile time","volume":"20","author":"Barth","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1145\/362790.362798","article-title":"A nonrecursive list compacting algorithm","volume":"13","author":"Cheney","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB6","first-page":"276","article-title":"Multiple reference management in flat GHC","volume":"Vol. 1","author":"Chikayama","year":"1987"},{"key":"10.1016\/0020-0190(93)90103-G_BIB7","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0020-0190(78)90025-X","article-title":"A note on shared list structure in LISP","volume":"7","author":"Clark","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90103-G_BIB8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/356850.356854","article-title":"Garbage collection of linked data structures","volume":"13","author":"Cohen","year":"1981","journal-title":"Comput. Surveys"},{"key":"10.1016\/0020-0190(93)90103-G_BIB9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/367487.367501","article-title":"A method for overlapping and erasure of lists","volume":"3","author":"Collins","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB10","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1145\/359642.359655","article-title":"On-the-fly garbage collection: an exercise in cooperation","volume":"21","author":"Dijkstra","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/363269.363280","article-title":"A LISP garbage collector for virtual-memory computer systems","volume":"12","author":"Fenichel","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB12","first-page":"907","article-title":"Optimization techniques using the MRB and their evaluation on the Multi-PSI\/V2","volume":"Vol. 2","author":"Inamura","year":"1989"},{"key":"10.1016\/0020-0190(93)90103-G_BIB13","series-title":"VLSI for Artificial Intelligence and Neural Networks","first-page":"33","article-title":"Incremental garbage collection scheme in KL1 and its architectural support of PIM","author":"Kimura","year":"1991"},{"key":"10.1016\/0020-0190(93)90103-G_BIB14","first-page":"39","article-title":"Garbage collecting the world","author":"Lang","year":"1992","journal-title":"Proc. Conf. Rec. 19th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0020-0190(93)90103-G_BIB15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/358141.358147","article-title":"A real-time garbage collector based on the lifetimes of objects","volume":"26","author":"Lieberman","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB16","series-title":"Proc. 7th Internat. Conf. on Logic Programming","first-page":"83","article-title":"Evaluation of MRB garbage collection on parallel logic programming architectures","author":"Nishida","year":"1990"},{"key":"10.1016\/0020-0190(93)90103-G_BIB17","doi-asserted-by":"crossref","unstructured":"W.R. Stoye, T.J.W. Clarke and A.C. Norman, Some practical methods for rapid combinator reduction, in: Proc. Conf. Rec. 1984 ACM Symp. on Lisp and Functional Programming, 159-166.","DOI":"10.1145\/800055.802032"},{"key":"10.1016\/0020-0190(93)90103-G_BIB18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/358506.358513","article-title":"Analysis of pointer \u2018rotation\u2019","volume":"25","author":"Suzuki","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/390010.808261","article-title":"Generation scavenging: a non-disruptive high-performance storage-reclamation algorithm","volume":"9","author":"Ungar","year":"1984","journal-title":"SOFT Software Engineering NOTES"},{"key":"10.1016\/0020-0190(93)90103-G_BIB20","first-page":"255","article-title":"Is there a use for linear logic?","volume":"26","author":"Wadler","year":"1991","journal-title":"Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices"},{"key":"10.1016\/0020-0190(93)90103-G_BIB21","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/367593.367617","article-title":"Symmetric list processor","volume":"6","author":"Weizenbaum","year":"1963","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90103-G_BIB22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/357062.357070","article-title":"Morris's garbage compaction algorithm restores reference counts","volume":"1","author":"Wise","year":"1979","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0020-0190(93)90103-G_BIB23","first-page":"289","article-title":"Design for a multiprocessing heap with on-board referencecounting","volume":"201","author":"Wise","year":"1985"},{"key":"10.1016\/0020-0190(93)90103-G_BIB24","series-title":"Stop-and-copy and one-bit reference counting (unabridged version) Tech. Rept. 360","author":"Wise","year":"1992"},{"key":"10.1016\/0020-0190(93)90103-G_BIB25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF01932156","article-title":"The one-bit reference count","volume":"17","author":"Wise","year":"1977","journal-title":"BIT"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390103G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390103G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:31Z","timestamp":1555144051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390103G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390103G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90103-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}