{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:13Z","timestamp":1773478993257,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319479576","type":"print"},{"value":"9783319479583","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47958-3_12","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T13:40:52Z","timestamp":1475934052000},"page":"206-226","source":"Crossref","is-referenced-by-count":24,"title":["Open Call-by-Value"],"prefix":"10.1007","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Guerrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Sacerdoti Coen, C.: On the relative usefulness of fireballs. In: LICS 2015, pp. 141\u2013155 (2015)","DOI":"10.1109\/LICS.2015.23"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2015.08.006","volume":"606","author":"B Accattoli","year":"2015","unstructured":"Accattoli, B.: Proof nets and the call-by-value $$\\lambda $$ -calculus. Theor. Comput. Sci. 606, 2\u201324 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR3","unstructured":"Accattoli, B., Guerrieri, G.: Open call-by-value (Extended Version). CoRR abs\/1609.00322 (2016). http:\/\/arxiv.org\/abs\/1609.00322"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-29822-6_4","volume-title":"Functional and Logic Programming","author":"B Accattoli","year":"2012","unstructured":"Accattoli, B., Paolini, L.: Call-by-value solvability, revisited. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol. 7294, pp. 4\u201316. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29822-6_4"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Sacerdoti Coen, C.: On the value of variables. In: WoLLIC 2014, pp. 36\u201350 (2014)","DOI":"10.1007\/978-3-662-44145-9_3"},{"issue":"4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1516507.1516508","volume":"31","author":"ZM Ariola","year":"2009","unstructured":"Ariola, Z.M., Bohannon, A., Sabry, A.: Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31(4), 13:1\u201313:48 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Greiner, J.: Parallelism in sequential functional languages. In: FPCA, pp. 226\u2013237 (1995)","DOI":"10.1145\/224164.224210"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-54830-7_7","volume-title":"Foundations of Software Science and Computation Structures","author":"A Carraro","year":"2014","unstructured":"Carraro, A., Guerrieri, G.: A semantical and operational account of call-by-value solvability. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 103\u2013118. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54830-7_7"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Curien, P.L., Herbelin, H.: The duality of computation. In: ICFP, pp. 233\u2013243 (2000)","DOI":"10.1145\/351240.351262"},{"key":"12_CR10","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-15240-5_13","volume-title":"Theoretical Computer Science","author":"P-L Curien","year":"2010","unstructured":"Curien, P.-L., Munch-Maccagnoni, G.: The duality of computation under focus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IAICT, vol. 323, pp. 165\u2013181. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15240-5_13"},{"issue":"1\u20133","key":"12_CR11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tcs.2008.01.044","volume":"398","author":"U Dal Lago","year":"2008","unstructured":"Dal Lago, U., Martini, S.: The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1\u20133), 32\u201350 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR12","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1093\/logcom\/exm037","volume":"17","author":"R Dyckhoff","year":"2007","unstructured":"Dyckhoff, R., Lengrand, S.: Call-by-value lambda-calculus and LJQ. J. Log. Comput. 17(6), 1109\u20131134 (2007)","journal-title":"J. Log. Comput."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, B., Leroy, X.: A compiled implementation of strong reduction. In: ICFP 2002, pp. 235\u2013246 (2002)","DOI":"10.1145\/581478.581501"},{"key":"12_CR14","unstructured":"Guerrieri, G.: Head reduction and normalization in a call-by-value lambda-calculus. In: WPTE 2015, pp. 3\u201317 (2015)"},{"key":"12_CR15","unstructured":"Guerrieri, G., Paolini, L., Ronchi Della Rocca, S.: Standardization of a call-by-value lambda-calculus. In: TLCA 2015, pp. 211\u2013225 (2015)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Herbelin, H., Zimmermann, S.: An operational account of call-by-value minimal and classical $$\\lambda $$ -calculus in natural deduction form. In: TLCA, pp. 142\u2013156 (2009)","DOI":"10.1007\/978-3-642-02273-9_12"},{"key":"12_CR17","volume-title":"Partial Evaluation and Automatic Program Generation","author":"ND Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Lassen, S.: Eager normal form bisimulation. In: LICS 2005, pp. 345\u2013354 (2005)","DOI":"10.1109\/LICS.2005.15"},{"key":"12_CR19","unstructured":"L\u00e9vy, J.J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. Th\u00e9se d\u2019Etat, Univ. Paris VII, France (1978)"},{"issue":"1\u20132","key":"12_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0304-3975(98)00358-2","volume":"228","author":"J Maraist","year":"1999","unstructured":"Maraist, J., Odersky, M., Turner, D.N., Wadler, P.: Call-by-name, call-by-value, call-by-need and the linear $$\\lambda $$ -calculus. TCS 228(1\u20132), 175\u2013210 (1999)","journal-title":"TCS"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Computational $$\\lambda $$ -calculus and Monads. In: LICS 1989, pp. 14\u201323 (1989)","DOI":"10.1109\/LICS.1989.39155"},{"issue":"20","key":"12_CR22","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1016\/j.tcs.2010.12.018","volume":"412","author":"L Paolini","year":"2011","unstructured":"Paolini, L., Pimentel, E., Ronchi Della Rocca, S.: Strong normalization from an unusual point of view. Theor. Comput. Sci. 412(20), 1903\u20131915 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Paolini, L.: Call-by-value separability and computability. In: ICTCS, pp. 74\u201389 (2002)","DOI":"10.1007\/3-540-45446-2_5"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Paolini, L., Pimentel, E., Ronchi Della Rocca, S.: Lazy strong normalization. In: ITRS 2004. Electronic Notes in Theoretical Computer Science, vol. 136C, pp. 103\u2013116 (2005)","DOI":"10.1016\/j.entcs.2005.06.013"},{"issue":"6","key":"12_CR25","first-page":"507","volume":"33","author":"L Paolini","year":"1999","unstructured":"Paolini, L., Ronchi Della Rocca, S.: Call-by-value solvability. ITA 33(6), 507\u2013534 (1999)","journal-title":"ITA"},{"issue":"2","key":"12_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"GD Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"issue":"126","key":"12_CR27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(94)90012-4","volume":"2","author":"L Regnier","year":"1994","unstructured":"Regnier, L.: Une \u00e9quivalence sur les lambda-termes. TCS 2(126), 281\u2013292 (1994)","journal-title":"TCS"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Ronchi Della Rocca, S., Paolini, L.: The Parametric $$\\lambda $$ -Calculus. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-662-10394-4"},{"issue":"3\u20134","key":"12_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A Sabry","year":"1993","unstructured":"Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. Lisp Symbolic Comput. 6(3\u20134), 289\u2013360 (1993)","journal-title":"Lisp Symbolic Comput."},{"issue":"6","key":"12_CR30","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1145\/267959.269968","volume":"19","author":"A Sabry","year":"1997","unstructured":"Sabry, A., Wadler, P.: A reflection on call-by-value. ACM Trans. Program. Lang. Syst. 19(6), 916\u2013941 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Sands, D., Gustavsson, J., Moran, A.: Lambda calculi and linear speedups. In: The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, pp. 60\u201384 (2002)","DOI":"10.1007\/3-540-36377-7_4"}],"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-319-47958-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T03:42:26Z","timestamp":1749613346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47958-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319479576","9783319479583"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}