{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:00:00Z","timestamp":1778299200367,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603597","type":"print"},{"value":"9783540450481","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026824","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:29:45Z","timestamp":1132396185000},"page":"241-258","source":"Crossref","is-referenced-by-count":5,"title":["Efficient compile-time garbage collection for arbitrary data structures"],"prefix":"10.1007","author":[{"given":"Markus","family":"Mohneu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Strictness analysis and polymorphic invariance. In G. Goos and J. Hartmanis, editors, Workshop on Programs as Data Objects, number 217 in LNCS, pages 1\u201324, 1986.","DOI":"10.1007\/3-540-16446-4_1"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"G. Baraki and J. Hughes. Abstract interpretation of polymorphic functions. In K. Davis and J. Hughes, editors, Functional Programming, Glasgow, 1989.","DOI":"10.1007\/978-1-4471-3166-3_3"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"H. Boehm. Space efficient conservative garbage collection. In Proc. of the ACM SIGPLAN '91 Conference, number 28 in SIGPLAN Notices, 1991.","DOI":"10.1145\/113445.113459"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"H. Boehm and M. Weiser. Garbage collection in an uncooperative environment. Software Practice & Experience, pages 807\u2013820, September 1988.","DOI":"10.1002\/spe.4380180902"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"A. Gill, J. Launchbury, and S. L. Peyton Jones. A short cut to deforestation. In Proc. of FPCA, 1993.","DOI":"10.1145\/165180.165214"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"G. W. Hamilton and S. B. Jones. Compile-time garbage collection by necessity analysis. In S. L. Peyton Jones, G. Hutton, and C. Kehler Holst, editors, Functional Programming, Glasgow, 1990.","DOI":"10.1007\/978-1-4471-3810-5_6"},{"issue":"4","key":"16_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1093\/logcom\/2.4.483","volume":"2","author":"S. Hughes","year":"1992","unstructured":"S. Hughes. Compile-time garbage collection for higher-order functional languages. Journal of Logic and Computation, 2(4):483\u2013509, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"S. B. Jones and D. Le M\u00e9tayer. Compile-time garbage collection by sharing analysis. In Proceedings of FPCA, 1989.","DOI":"10.1145\/99370.99375"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"T. P. Jensen and T. A. E. Mogensen. A backward analysis for compile-time garbage collection. In G. Goos and J. Hartmanis, editors, Proceedings of ESOP 90, number 432 in LNCS, pages 227\u2013239, 1990.","DOI":"10.1007\/3-540-52592-0_66"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"M. Mohnen. Efficient closure utilisation by higher-order inheritance analysis. To appear in Proceedings of SAS 95 (LNCS), 1995.","DOI":"10.1007\/3-540-60360-3_44"},{"key":"16_CR11","volume-title":"Technical Report 95-9","author":"M. Mohnen","year":"1995","unstructured":"M. Mohnen. Functional specification of imperative programs: An alternative point of view of functional languages. Technical Report 95-9, RWTH Aachen, 1995."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"A. Mycroft. Theory and practice of transforming call-by-need into call-by-value. In Proceedings of the International Symposium on Programming, number 83 in LNCS, pages 269\u2013281, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Y. G. Park and B. Goldberg. Escape analysis on lists. In PLDI 92, ACM SIGPLAN, pages 116\u2013127, 1992.","DOI":"10.1145\/143095.143125"},{"issue":"4","key":"16_CR14","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/48022.48025","volume":"10","author":"K. Inoue","year":"1988","unstructured":"K. Inoue, H. Seki and H. Yagi. Analysis of functional programs to detect run-time garbage cells. TOPLAS, 10(4):555\u2013578, October 1988.","journal-title":"TOPLAS"},{"issue":"73","key":"16_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"1","author":"P. Wadler","year":"1990","unstructured":"P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 1(73):231\u2013248, 1990.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:53:49Z","timestamp":1586570029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0026824","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}