{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:34:47Z","timestamp":1693866887264},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":[[1995,10]]},"DOI":"10.1016\/0020-0190(95)00131-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:51Z","timestamp":1027634571000},"page":"1-7","source":"Crossref","is-referenced-by-count":5,"title":["Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach"],"prefix":"10.1016","volume":"56","author":[{"given":"Stephen","family":"Thomas","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00131-U_BIB1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1145\/362790.362798","article-title":"A non-recursive list compacting algorithm","volume":"13","author":"Cheney","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(95)00131-U_BIB2","series-title":"Proc. 1987 Conf. on Functional Programming and Computer Architecture","article-title":"TIM: A simple, lazy abstract machine to execute supercombinators","author":"Fairbairn","year":"1987"},{"key":"10.1016\/0020-0190(95)00131-U_BIB3","author":"SPARC International, Inc.","year":"1992"},{"key":"10.1016\/0020-0190(95)00131-U_BIB4","article-title":"The pragmatics of closure reduction","author":"Thomas","year":"1993"},{"key":"10.1016\/0020-0190(95)00131-U_BIB5","article-title":"The OP-TIM \u2014 A better PG-TIM","author":"Thomas","year":"1995"},{"key":"10.1016\/0020-0190(95)00131-U_BIB6_1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/390011.808261","article-title":"Generation scavenging: A non-disruptive high performance storage reclamation algorithm","volume":"19","author":"Ungar","year":"1984","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0020-0190(95)00131-U_BIB6_2","volume":"3","author":"Ungar","year":"1984","journal-title":"ACM Software Engineering Notes 9"},{"key":"10.1016\/0020-0190(95)00131-U_BIB7","author":"VLSI Technology, Inc.","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500131U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500131U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:58:40Z","timestamp":1555282720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500131U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["002001909500131U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00131-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}