{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T10:08:30Z","timestamp":1749118110042},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370359"},{"type":"electronic","value":"9783642370366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_5","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:35:55Z","timestamp":1361216155000},"page":"81-100","source":"Crossref","is-referenced-by-count":6,"title":["Laziness by Need"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Abelson, H., Sussman, G.J., Sussman, J.: Structure and Interpretation of Computer Programs. MIT Press (1984)"},{"key":"5_CR2","unstructured":"Aditya, S., Arvind, Augustsson, L., Maessen, J.W., Nikhil, R.S.: Semantics of pH: A parellel dialect of Haskell. In: Proc. Haskell Workshop, pp. 34\u201349 (1995)"},{"key":"5_CR3","unstructured":"Appel, A., Blume, M., Gansner, E., George, L., Huelsbergen, L., MacQueen, D., Reppy, J., Shao, Z.: Standard ML of New Jersey User\u2019s Guide (1997)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G.L. Burn","year":"1986","unstructured":"Burn, G.L., Hankin, C.L., Abramsky, S.: Strictness analysis for higher-order functions. Sci. Comput. Program.\u00a07, 249\u2013278 (1986)","journal-title":"Sci. Comput. Program."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Crestani, M., Sperber, M.: Experience report: growing programming languages for beginning students. In: Proc. 15th ICFP, pp. 229\u2013234 (2010)","DOI":"10.1145\/1863543.1863576"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ennals, R., Peyton Jones, S.: Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. In: Proc. 8th ICFP, pp. 287\u2013298 (2003)","DOI":"10.1145\/944746.944731"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Fax\u00e9n, K.F.: Cheap eagerness: speculative evaluation in a lazy functional language. In: Proc. 5th ICFP, pp. 150\u2013161 (2000)","DOI":"10.1145\/357766.351255"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-85373-2_7","volume-title":"Implementation and Application of Functional Languages","author":"R.B. Findler","year":"2008","unstructured":"Findler, R.B., Guo, S.-Y., Rogers, A.: Lazy Contract Checking for Immutable Data Structures. In: Chitil, O., Horv\u00e1th, Z., Zs\u00f3k, V. (eds.) IFL 2007. LNCS, vol.\u00a05083, pp. 111\u2013128. Springer, Heidelberg (2008)"},{"key":"5_CR9","unstructured":"Flanagan, C., Felleisen, M.: Modular and polymorphic set-based analysis: Theory and practice. Tech. Rep. TR96-266, Rice Univ. (1996)"},{"key":"5_CR10","unstructured":"Flatt, M., PLT: Reference: Racket. Tech. Rep. PLT-TR-2012-1, PLT Inc. (2012), \n                    \n                      http:\/\/racket-lang.org\/tr1\/"},{"key":"5_CR11","unstructured":"Friedman, D., Wise, D.: Cons should not evaluate its arguments. In: Proc. 3rd ICALP, pp. 257\u2013281 (1976)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Comput. J.\u00a032, 98\u2013107 (1989)","journal-title":"Comput. J."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Flow analysis of lambda expressions. Tech. rep., Aarhus Univ. (1981)","DOI":"10.7146\/dpb.v10i128.7404"},{"key":"5_CR14","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml system, release 3.12, Documentation and user\u2019s manual. INRIA (July 2011)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Maessen, J.W.: Eager Haskell: resource-bounded execution yields efficient iteration. In: Proc. Haskell Workshop, pp. 38\u201350 (2002)","DOI":"10.1145\/581690.581694"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-31057-7_6","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"F. Morandat","year":"2012","unstructured":"Morandat, F., Hill, B., Osvald, L., Vitek, J.: Evaluating the Design of the R Language. In: Noble, J. (ed.) ECOOP 2012. LNCS, vol.\u00a07313, pp. 104\u2013131. Springer, Heidelberg (2012)"},{"key":"5_CR17","unstructured":"Mycroft, A.: Abstract interpretation and optimising transformations for applicative programs. Ph.D. thesis, Univ. Edinburgh (1981)"},{"key":"5_CR18","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer (2005)"},{"key":"5_CR19","unstructured":"Odersky, M.: The Scala Language Specification, Version 2.9. EPFL (May 2011)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge Univ. Press (1998)","DOI":"10.1017\/CBO9780511530104"},{"key":"5_CR21","unstructured":"Hari Prashanth, K.R., Tobin-Hochstadt, S.: Functional data structures for Typed Racket. In: Proc. Scheme Workshop (2010)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Rees, J., Clinger, W. (eds.): Revised3 Report on the Algorithmic Language Scheme. ACM SIGPLAN Notices (December 1986)","DOI":"10.1145\/15042.15043"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Schauser, K.E., Goldstein, S.C.: How much non-strictness do lenient programs require? In: Proc. 7th FPCA (1995)","DOI":"10.1145\/224164.224208"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Sestoft, P.: Replacing function parameters by global variables. Master\u2019s thesis, Univ. Copenhagen (1988)","DOI":"10.1145\/99370.99374"},{"key":"5_CR25","unstructured":"Sheard, T.: A pure language with default strict evaluation order and explicit laziness. In: 2003 Haskell Workshop: New Ideas Session (2003)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control-flow analysis in scheme. In: Proc. PLDI, pp. 164\u2013174 (1988)","DOI":"10.1145\/960116.54007"},{"key":"5_CR27","unstructured":"Wadler, P., Taha, W., MacQueen, D.: How to add laziness to a strict language, without even being odd. In: Proc. Standard ML Workshop (1998)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T08:44:04Z","timestamp":1557564244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}