{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:40Z","timestamp":1763468080471},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_6","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"32-46","source":"Crossref","is-referenced-by-count":12,"title":["Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts"],"prefix":"10.1007","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[]},{"given":"Paul","family":"Downen","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Herbelin","sequence":"additional","affiliation":[]},{"given":"Keiko","family":"Nakata","sequence":"additional","affiliation":[]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","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. J. Funct. Program.\u00a07(3), 265\u2013301 (1997)","journal-title":"J. Funct. Program."},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1017\/S0956796807006612","volume":"18","author":"Z.M. Ariola","year":"2008","unstructured":"Ariola, Z.M., Herbelin, H.: Control reduction theories: the benefit of structural substitution. J. Funct. Program.\u00a018(3), 373\u2013419 (2008)","journal-title":"J. Funct. Program."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-21691-6_6","volume-title":"Typed Lambda Calculi and Applications","author":"Z.M. Ariola","year":"2011","unstructured":"Ariola, Z.M., Herbelin, H., Saurin, A.: Classical Call-by-Need and Duality. In: Ong, L. (ed.) TLCA 2011. LNCS, vol.\u00a06690, pp. 27\u201344. Springer, Heidelberg (2011)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-04652-0_3","volume-title":"Advanced Functional Programming","author":"O. Danvy","year":"2009","unstructured":"Danvy, O.: From Reduction-Based to Reduction-Free Normalization. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol.\u00a05832, pp. 66\u2013164. Springer, Heidelberg (2009)"},{"key":"6_CR5","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":"6_CR6","first-page":"153","volume-title":"Proceedings of POPL 2009","author":"R. Garcia","year":"2009","unstructured":"Garcia, R., Lumsdaine, A., Sabry, A.: Lazy evaluation and delimited control. In: Proceedings of POPL 2009, pp. 153\u2013164. ACM, New York (2009)"},{"issue":"3","key":"6_CR7","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 \u03bb-calculus. J. Funct. Program.\u00a08(3), 275\u2013317 (1998)","journal-title":"J. Funct. Program."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Okasaki, C., Lee, P., Tarditi, D.: Call-by-need and continuation-passing style. In: Lisp and Symbolic Computation, pp. 57\u201381. Kluwer Academic Publishers (1993)","DOI":"10.1007\/BF01019945"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Parigot, M.: \u03bb\n                \u03bc-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)","DOI":"10.1007\/BFb0013061"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:33Z","timestamp":1620127053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}