{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:55:49Z","timestamp":1649066149181},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":[[1989,2]]},"DOI":"10.1016\/0020-0190(89)90128-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"115-118","source":"Crossref","is-referenced-by-count":0,"title":["Customizable garbage collectors"],"prefix":"10.1016","volume":"30","author":[{"given":"Matti O.","family":"Jokinen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90128-2_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","article-title":"\u201cMemo\u201d functions and machine learning","volume":"218","author":"Michie","year":"1968","journal-title":"Nature"},{"key":"10.1016\/0020-0190(89)90128-2_BIB2","series-title":"Functional Programming Languages and Computer Architecture","first-page":"129","article-title":"Lazy memo functions","volume":"201","author":"Hughes","year":"1985"},{"key":"10.1016\/0020-0190(89)90128-2_BIB3","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01940778","article-title":"Elimination of recursive calls using a small table of \u201crandomly\u201d selected function values","volume":"16","author":"Hilden","year":"1976","journal-title":"BIT"},{"key":"10.1016\/0020-0190(89)90128-2_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(76)90011-9","article-title":"Garbage collecting a heap which includes a scatter table","volume":"5","author":"Freidman","year":"1976","journal-title":"Inform. Process. Lett."},{"issue":"12","key":"10.1016\/0020-0190(89)90128-2_BIB5","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"},{"issue":"9","key":"10.1016\/0020-0190(89)90128-2_BIB6","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(89)90128-2_BIB7","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":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0190(89)90128-2_BIB8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine","volume":"6","author":"McCarthy","year":"1960","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:55:36Z","timestamp":1555088136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0020019089901282"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90128-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}