{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:26:54Z","timestamp":1725636414009},"publisher-location":"London","reference-count":5,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198796"},{"type":"electronic","value":"9781447132363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/978-1-4471-3236-3_11","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T04:23:05Z","timestamp":1322108585000},"page":"138-144","source":"Crossref","is-referenced-by-count":0,"title":["The Implementer\u2019s Dilemma: A Mathematical Model of Compile Time Garbage Collection"],"prefix":"10.1007","author":[{"given":"Simon B.","family":"Jones","sequence":"first","affiliation":[]},{"given":"Andrew S.","family":"Tyas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(87)90175-X","volume":"25","author":"AW Appel","year":"1987","unstructured":"A.W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275\u2013279, June 1987.","journal-title":"Information Processing Letters"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"J. Heyman. A comprehensive analytical model for garbage collection algorithms. ACM SIGPLAN Notices, 26(8), August 1991.","DOI":"10.1145\/122598.122602"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"S.B. Jones and D. Le M\u00e9tayer. Compile-time garbage collection by sharing analysis. In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 54\u201374, 1989.","DOI":"10.1145\/99370.99375"},{"key":"11_CR4","unstructured":"P. Sansom. Combining copying and compacting garbage collection. In R. Heldal, C.K. Hoist, and P. Wadler, editors, 1991 Glasgow Workshop on Functional Programming. Springer-Verlag, Workshops in Computing, August 1991."},{"key":"11_CR5","unstructured":"A.S. Tyas. An investigation into the optimization of garbage collection within functional languages. Final Year Dissertation, Department of Computing Science and Mathematics, University of Stirling, April 1993."}],"container-title":["Workshops in Computing","Functional Programming, Glasgow 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3236-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T20:33:05Z","timestamp":1560976385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3236-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540198796","9781447132363"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3236-3_11","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1994]]}}}