{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:09Z","timestamp":1725664989373},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:19:01Z","timestamp":1330294741000},"page":"255-269","source":"Crossref","is-referenced-by-count":3,"title":["Compiling laziness using projections"],"prefix":"10.1007","author":[{"given":"Ross","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"18_CR1","first-page":"218","volume-title":"volume 724 of Lecture Notes in Computer Science","author":"T. Amtoft","year":"1993","unstructured":"Torben Amtoft. Minimal thunkification. In Patrick Cousot et al., editors, Static Analysis: 3rd International Workshop, WSA '93, Padova, Italy, volume 724 of Lecture Notes in Computer Science, pages 218\u2013229. Springer, 1993."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Andrew A. Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"18_CR3","doi-asserted-by":"publisher","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 of higher order functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"18_CR4","first-page":"346","volume-title":"volume 714 of Lecture Notes in Computer Science","author":"G. L. Burn","year":"1993","unstructured":"Geoffrey L. Burn and Daniel Le M\u00e9tayer. Proving the correctness of compiler optimisations based on a global program analysis. In Fifth International Symposium on Programming Language Implementation and Logic Programming, volume 714 of Lecture Notes in Computer Science, pages 346\u2013364, Tallinn, Estonia, August 1993. Springer."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"W. Clinger and J. Rees. Revised4 report on the algorithmic language Scheme. ACM Lisp Pointers, IV, July\u2013September 1991.","DOI":"10.1145\/1317265.1317268"},{"issue":"3","key":"18_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/151640.151641","volume":"1","author":"O. Danvy","year":"1992","unstructured":"Olivier Danvy and John Hatcliff. CPS-transformation after strictness analysis. ACM Letters on Programming Languages and Systems, 1(3):195\u2013212, 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Kei Davis and Philip Wadler. Strictness analysis in 4D. In 1990 Glasgow Workshop on Functional Programming, Workshops in Computing, pages 23\u201343. Springer, 1991.","DOI":"10.1007\/978-1-4471-3810-5_3"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Karl-Filip Fax\u00e9n. Optimizing lazy functional programs using flow inference. In Static Analysis, Second International Symposium, volume 983 of Lecture Notes in Computer Science, pages 136\u2013153. Springer, 1995.","DOI":"10.1007\/3-540-60360-3_37"},{"key":"18_CR9","unstructured":"Karl-Filip Fax\u00e9n. Flow inference, code generation and garbage collection for lazy functional languages. Licentiate thesis, Kungl Tekniska H\u00f6gskolan, January 1996."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cordelia V. Hall and David S. Wise. Compiling strictness into streams. In 14th ACM Symposium on Principles of Programming Languages, pages 132\u2013143, Munich, January 1987.","DOI":"10.1145\/41625.41637"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Paul Hudak, Simon Peyton Jones, Philip Wadler, et al. Report on the programming language Haskell, a non-strict purely functional language (Version 1.2). SIGPLAN Notices, 27(5), March 1992.","DOI":"10.1145\/130697.130699"},{"key":"18_CR12","unstructured":"Sebastian Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Imperial College of Science, Technology and Medicine, 1991."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Ryszard Kubiak, John Hughes, and John Launchbury. Implementing projectionbased strictness analysis. In 1991 Glasgow Workshop on Functional Programming, Workshops in Computing, pages 207\u2013224. Springer, 1992.","DOI":"10.1007\/978-1-4471-3196-0_17"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/99370.99390","volume-title":"FPCA '89","author":"T-M. Kuo","year":"1989","unstructured":"T-M. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In FPCA '89, London, England, pages 260\u2013272. ACM Press, September 1989."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"John Launchbury and Gebreselassie Baraki. Representing demand by partial projections. Journal of Functional Programming, 6(4), 1996.","DOI":"10.1017\/S0956796800001878"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"John Launchbury and Ross Paterson. Parametricity and unboxing with unpointed types. In European Symposium on Programming, volume 1058 of Lecture Notes in Computer Science, pages 204\u2013218, Link\u00f6ping, Sweden, April 1996.","DOI":"10.1007\/3-540-61055-3_38"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Alan Mycroft. The theory and practice of transforming call-by-need into call-by-value. In B. Robinet, editor, International Symposium on Programming, volume 83 of Lecture Notes in Computer Science. Springer, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"issue":"2","key":"18_CR18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. L. P. Jones","year":"1992","unstructured":"Simon L. Peyton Jones. Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. Journal of Functional Programming, 2(2):127\u2013202, July 1992.","journal-title":"Journal of Functional Programming"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Conference on Functional Programming Languages and Computer Architecture, pages 636\u2013666, Cambridge, MA, 1991.","DOI":"10.1007\/3540543961_30"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Philip Wadler and John Hughes, Projections for strictness analysis. In Conference on Functional Programming Languages and Computer Architecture, volume 274 of Lecture Notes in Computer Science, Portland, OR, 1987.","DOI":"10.1007\/3-540-18317-5_21"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:09Z","timestamp":1605647409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}