{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:33Z","timestamp":1725663573146},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572640"},{"type":"electronic","value":"9783540480273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:34:30Z","timestamp":1330259670000},"page":"218-229","source":"Crossref","is-referenced-by-count":7,"title":["Minimal thunkification"],"prefix":"10.1007","author":[{"given":"Torben","family":"Amtoft","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"19_CR1","volume-title":"Technical Report PB-448","author":"T. Amtoft","year":"1993","unstructured":"Torben Amtoft. Strictness types: An inference algorithm and an application. Technical Report PB-448, DAIMI, University of Aarhus, Denmark, 1993."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"Geoffrey L. Burn, Chris Hankin, and Samson Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Olivier Danvy and John Hatcliff. Thunks (continued). In M. Billaud et al., editor, Analyse statique, Bordeaux 92 (WSA '92), pages 3\u201311, September 1992.","DOI":"10.1177\/0887302X9201100113"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Olivier Danvy and John Hatcliff. CPS transformation after strictness analysis. ACM Letters on Programming Languages and Systems, 1(3), 1993.","DOI":"10.1145\/151640.151641"},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"John Hughes. Why functional programming matters. Computer Journal, 32(2):98\u2013107, 1989.","journal-title":"Computer Journal"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Strictness analysis in logical form. In John Hughes, editor, International Conference on Functional Programming Languages and Computer Architecture, pages 352\u2013366. Springer Verlag, LNCS 523, August 1991.","DOI":"10.1007\/3540543961_17"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Tsung-Min Kuo and Prateek Mishra. Strictness analysis: A new perspective based on type inference. In International Conference on Functional Programming Languages and Computer Architecture, pages 260\u2013272. ACM Press, September 1989.","DOI":"10.1145\/99370.99390"},{"key":"19_CR8","volume-title":"Technical Report PB-427","author":"Torben Poort Lange","year":"1992","unstructured":"Torben Poort Lange. The correctness of an optimized code generation. Technical Report PB-427, DAIMI, University of Aarhus, Denmark, November 1992. Also in the proceedings of PEPM '93, Copenhagen, ACM press."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Alan Mycroft. The theory of transforming call-by-need to call-by-value. In B. Robinet, editor, International Symposium on Programming, Paris, pages 269\u2013281. Springer Verlag, LNCS 83, April 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Hanne Riis Nielson and Flemming Nielson. Context information for lazy code generation. In ACM Conference on Lisp and Functional Programming, pages 251\u2013263. ACM Press, June 1990.","DOI":"10.1145\/91556.91665"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Mitchell Wand. Specifying the correctness of binding-time analysis. In ACM Symposium on Principles of Programming Languages, pages 137\u2013143. ACM Press, January 1993.","DOI":"10.1145\/158511.158614"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"David A. Wright. A new technique for strictness analysis. In TAPSOFT 91, pages 235\u2013258. Springer Verlag, LNCS 494, April 1991.","DOI":"10.1007\/3540539816_70"},{"key":"19_CR13","unstructured":"David A. Wright. An intensional type discipline. Australian Computer Science Communications, 14, January 1992."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:24:06Z","timestamp":1640928246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}