{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:54:32Z","timestamp":1725602072532},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229404"},{"type":"electronic","value":"9783642229411"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22941-1_1","type":"book-chapter","created":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T12:23:14Z","timestamp":1314102194000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating Call-by-Need on the Control Stack"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Van Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science\u00a01, 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. Journal of Functional Programming\u00a07, 265\u2013301 (1997)","journal-title":"Journal of Functional Programming"},{"key":"1_CR3","first-page":"153","volume-title":"Proceedings of the 36th Annual Symposium on Principles of Programming Languages","author":"R. Garcia","year":"2009","unstructured":"Garcia, R., Lumsdaine, A., Sabry, A.: Lazy evaluation and delimited control. In: Proceedings of the 36th Annual Symposium on Principles of Programming Languages, pp. 153\u2013164. ACM, New York (2009)"},{"key":"1_CR4","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1981","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam (1981)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"De Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 381\u2013392 (1972)","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"1_CR6","volume-title":"Semantics Engineering with PLT Redex","author":"M. Felleisen","year":"2009","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. MIT Press, Cambridge (2009)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. In: Proceedings of the 22nd Annual Symposium on Principles on Programming Languages, pp. 233\u2013246 (1995)","DOI":"10.1145\/199448.199507"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1017\/S0956796898003037","volume":"8","author":"J. Maraist","year":"1998","unstructured":"Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. Journal of Functional Programming\u00a08, 275\u2013317 (1998)","journal-title":"Journal of Functional Programming"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-12251-4_18","volume-title":"Functional and Logic Programming","author":"O. Danvy","year":"2010","unstructured":"Danvy, O., Millikin, K., Munk, J., Zerny, I.: Defunctionalized interpreters for call-by-need evaluation. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol.\u00a06009, pp. 240\u2013256. Springer, Heidelberg (2010)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Danvy, O., Zerny, I.: Three syntactic theories for combinatory graph reduction. In: Alpuente, M. (ed.) 20th International Symposium on Logic-Based Program Synthesis and Transformation (2010) (invited talk)","DOI":"10.1007\/978-3-642-20551-4_1"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science\u00a0103, 235\u2013271 (1992)","journal-title":"Theoretical Computer Science"},{"key":"1_CR12","unstructured":"Kelsey, R.: Tail-recursive stack disciplines for an interpreter. Technical Report NU-CCS-93-03, Northeastern University (1993)"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22941-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T04:36:29Z","timestamp":1560486989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22941-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229404","9783642229411"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22941-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}