{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:07Z","timestamp":1742598607182,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:27:39Z","timestamp":1330273659000},"page":"162-178","source":"Crossref","is-referenced-by-count":5,"title":["Selective thunkification"],"prefix":"10.1007","author":[{"given":"Paul","family":"Steckler","sequence":"first","affiliation":[]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Torben Amtoft. Minimal Thunkification. In Patrick Cousot et al., editors, Proc. 3rd International Workshop on Static Analysis (WSA '93), number 724 in Lecture Notes in Computer Science, pages 218\u201329, Padova, Italy, 1993.","DOI":"10.1007\/3-540-57264-3_43"},{"key":"10_CR2","unstructured":"Geoffrey Burn and Daniel Le M\u00e9tayer. Proving the Correctness of Compiler Optimisations Based on a Global Program Analysis: A Study of Strictness Analysis. Technical Report TR93-42, Department of Computing, Imperial College of Science, Technology and Medicine, August 1993."},{"key":"10_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 for Higher-order Functions. Science of Computer Programming, 7:249\u201378, 1986.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/151640.151641","volume":"1","author":"O. Danvy","year":"1993","unstructured":"Olivier Danvy, and John Hatcliff. CPS Transformation After Strictness Analysis. ACM Letters on Programming Languages, 1(3):195\u2013212, 1993.","journal-title":"ACM Letters on Programming Languages"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Paul Hudak and Jonathan Young. Higher-Order Strictness Analysis in Untyped Lambda Calculus. In Conference Record of 13th ACM Symposium on Principles of Programming Languages, pages 97\u2013109, 1986.","DOI":"10.1145\/512644.512653"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Strictness Analysis in Logical Form. In John Hughes, editor, International Conf. on Functional Programming Languages and Computer Architecture, pages 352\u201366, 1991.","DOI":"10.1007\/3540543961_17"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Tsung-Min Kuo and Prateek Mishra. Strictness Analysis: A New Perspective. In International Conf. on Functional Programming and Computer Architecture, pages 260\u201372, 1989.","DOI":"10.1145\/99370.99390"},{"key":"10_CR8","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, pages 269\u201381, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"10_CR9","unstructured":"Jens Palsberg and Michael I. Schwartzbach. Safety Analysis vs. Type Inference. Information and Computation, to appear."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"Gordon D. Plotkin. Call-by-Name, Call-by-Value and the \u03bb-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"10_CR11","unstructured":"Paul Steckler. Correctness of Higher-Order Program Transformations. PhD thesis, College of Computer Science, Northeastern University, July 1994."},{"key":"10_CR12","unstructured":"Paul Steckler and Mitchell Wand. Tracking Available Values for Lightweight Closures (Summary). In Neil Jones and Carolyn Talcott, editors, Proc. Atlantique Workshop on Semantics Based Program Manipulation, pages 63\u201370, 1994. Available as DIKU Report No. 94\/12, University of Copenhagen."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Robert E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Mitchell Wand and Paul Steckler. Selective and Lightweight Closure Conversion. In Conference Record of 21st ACM Symposium on Principles of Programming Languages, pages 435\u201345, 1994.","DOI":"10.1145\/174675.178044"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"David A. Wright. A New Technique for Strictness Analysis. In Proc. TAPSOFT '91, pages 235\u201358, 1991.","DOI":"10.1007\/3540539816_70"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:33:10Z","timestamp":1742596390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}