{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:40Z","timestamp":1742914120162,"version":"3.40.3"},"publisher-location":"London","reference-count":9,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197607"},{"type":"electronic","value":"9781447131960"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3196-0_25","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:48:08Z","timestamp":1323658088000},"page":"312-323","source":"Crossref","is-referenced-by-count":4,"title":["Combining Single-Space and Two-Space Compacting Garbage Collectors"],"prefix":"10.1007","author":[{"given":"Patrick M","family":"Sansom","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(87)90175-X","volume":"25","author":"AW Appel","year":"1987","unstructured":"AW Appel, \u201cGarbage collection can be faster than stack allocation,\u201d Info Proc Lett 25 (1987), 275\u2013279.","journal-title":"Info Proc Lett"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/spe.4380190206","volume":"19","author":"AW Appel","year":"1989","unstructured":"AW Appel, \u201cSimple generational garbage collection and fast allocation,\u201d Software \u2014 Practice and Experience 19 (Feb 1989), 171\u2013183.","journal-title":"Software \u2014 Practice and Experience"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1145\/362790.362798","volume":"13","author":"CJ Cheney","year":"1970","unstructured":"CJ Cheney, \u201cA nonrecursive list compacting algorithm,\u201d CACM 13 (Nov 1970), 677\u2013678.","journal-title":"CACM"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0020-0190(79)90103-0","volume":"9","author":"HBM Jonkers","year":"1979","unstructured":"HBM Jonkers, \u201cA fast garbage compaction algorithm,\u201d Info Proc Lett 9 (July 1979), 26\u201330.","journal-title":"Info Proc Lett"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/358141.358147","volume":"26","author":"H Lieberman","year":"1983","unstructured":"H Lieberman & C Hewitt, \u201cA real-time garbage collector based on the lifetimes of objects,\u201d CACM 26 (June 1983), 419\u2013429.","journal-title":"CACM"},{"key":"25_CR6","volume-title":"The spineless tagless G-machine: a second attempt","author":"SL Peyton Jones","year":"1991","unstructured":"SL Peyton Jones, \u201cThe spineless tagless G-machine: a second attempt,\u201d Dept of Computer Science, University of Glasgow, 1991."},{"key":"25_CR7","volume-title":"Multiprocessor list memory management","author":"M Rudalics","year":"1988","unstructured":"M Rudalics, \u201cMultiprocessor list memory management,\u201d RISC-LINZ Series no 88-87.0, Reasearch Inst for Symbolic Computation, Johannes Kepler University, Dec 1988."},{"key":"25_CR8","volume-title":"Proc Third International Workshop on Implementation of Functional Languages on Parallel Architectures","author":"PM Sansom","year":"1991","unstructured":"PM Sansom, \u201cDual-mode garbage collection,\u201d in Proc Third International Workshop on Implementation of Functional Languages on Parallel Architectures, CSTR 91 - 07, Dept of Electronics and Computing Science, University of Southampton, June 1991."},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/363534.363554","volume":"10","author":"H Schorr","year":"1967","unstructured":"H Schorr & WM Waite, \u201cAn effecient machine-independent procedure for garbage collection in various list structures.,\u201d CACM 10 (Aug 1967), 501\u2013506.","journal-title":"CACM"}],"container-title":["Workshops in Computing","Functional Programming, Glasgow 1991"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3196-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T21:17:42Z","timestamp":1676755062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3196-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197607","9781447131960"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3196-0_25","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}