{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:52:08Z","timestamp":1762458728203,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022722"},{"type":"electronic","value":"9783642022739"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02273-9_12","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T10:12:17Z","timestamp":1246011137000},"page":"142-156","source":"Crossref","is-referenced-by-count":17,"title":["An Operational Account of Call-by-Value Minimal and Classical \u03bb-Calculus in \u201cNatural Deduction\u201d Form"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Herbelin","sequence":"first","affiliation":[]},{"given":"St\u00e9phane","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_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 lambda-calculus. Theor. Comput. Sci.\u00a01, 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR2","unstructured":"Moggi, E.: Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-66, Edinburgh Univ. (1988)"},{"issue":"3-4","key":"12_CR3","doi-asserted-by":"publisher","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 and Symbolic Computation\u00a06(3-4), 289\u2013360 (1993)","journal-title":"Lisp and Symbolic Computation"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001195","volume":"5","author":"M. Hofmann","year":"1995","unstructured":"Hofmann, M.: Sound and complete axiomatisations of call-by-value control operators. Mathematical Structures in Computer Science\u00a05(4), 461\u2013482 (1995)","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Dezani-Ciancaglini, M., Giovannetti, E.: From B\u00f6hm\u2019s theorem to observational equivalences: an informal account. Electr. Notes Theor. Comput. Sci. 50(2) (2001)","DOI":"10.1016\/S1571-0661(04)00167-7"},{"key":"12_CR6","series-title":"SIGPLAN Notices","first-page":"233","volume-title":"Proceedings of ICFP 2000","author":"P.L. Curien","year":"2000","unstructured":"Curien, P.L., Herbelin, H.: The duality of computation. In: Proceedings of ICFP 2000. SIGPLAN Notices, vol.\u00a035(9), pp. 233\u2013243. ACM, New York (2000)"},{"key":"12_CR7","unstructured":"Herbelin, H.: C\u2019est maintenant qu\u2019on calcule: au c\u0153ur de la dualit\u00e9. Habilitation thesis, University Paris 11 (December 2005)"},{"key":"#cr-split#-12_CR8.1","doi-asserted-by":"crossref","unstructured":"Gentzen, G.: Untersuchungen ??ber das logische Schlie??en. Mathematische Zeitschrift 39, 176???210,405???431 (1935);","DOI":"10.1007\/BF01201363"},{"key":"#cr-split#-12_CR8.2","unstructured":"English Translation in The Collected Works of Gerhard Gentzen, Szabo, M. E. (ed.), pp. 68???131"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(94)90012-4","volume":"126","author":"L. Regnier","year":"1994","unstructured":"Regnier, L.: Une \u00e9quivalence sur les lambda-termes. Theor. Comput. Sci.\u00a0126(2), 281\u2013292 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","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.\u00a019(6), 916\u2013941 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"12_CR12","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. Journal of Functional Programming\u00a018(3), 373\u2013419 (2008); with a historical note by Matthias Felleisen","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.2307\/2694930","volume":"66","author":"R. David","year":"2001","unstructured":"David, R., Py, W.: Lambda-mu-calculus and B\u00f6hm\u2019s theorem. J. Symb. Log.\u00a066(1), 407\u2013413 (2001)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02273-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:19:47Z","timestamp":1558394387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02273-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022722","9783642022739"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02273-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}