{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:26Z","timestamp":1760202626142,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"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-19805-2_23","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T13:05:14Z","timestamp":1300107914000},"page":"335-349","source":"Crossref","is-referenced-by-count":5,"title":["Estimation of the Length of Interactions in Arena Game Semantics"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Clairambault","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-1-4757-3851-3_10","volume-title":"Algol-like Languages","author":"Samson Abramsky","year":"1997","unstructured":"Abramsky, S., McCusker, G.: Linearity, Sharing and State: a Fully Abstract Game Semantics for Idealized Algol with active expressions (1997)"},{"key":"23_CR2","first-page":"1","volume-title":"Computer Science Logic","author":"Samson Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol.\u00a01414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.2307\/2695106","volume":"66","author":"A. Beckmann","year":"2001","unstructured":"Beckmann, A.: Exact bounds for lengths of reductions in typed \u03bb-calculus. Journal of Symbolic Logic\u00a066(3), 1277\u20131285 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR4","unstructured":"Blum, W.: Thesis fascicle: Local computation of \u03b2-reduction. PhD thesis, University of Oxford (2008)"},{"key":"23_CR5","unstructured":"Clairambault, P.: Logique et Interaction: une \u00c9tude S\u00e9mantique de la Totalit\u00e9. PhD thesis, Universit\u00e9 Paris Diderot (2010)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Clairambault, P., Harmer, R.: Totality in arena games. Annals of Pure and Applied Logic (2009)","DOI":"10.1016\/j.apal.2009.07.016"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.2307\/2275524","volume":"60","author":"T. Coquand","year":"1995","unstructured":"Coquand, T.: A semantics of evidence for classical arithmetic. Journal of Symbolic Logic\u00a060(1), 325\u2013337 (1995)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics and abstract machines. In: 11th IEEE Symposium on Logic in Computer Science, pp. 394\u2013405 (1996)","DOI":"10.1109\/LICS.1996.561456"},{"key":"23_CR9","unstructured":"Danos, V., Regnier, L.: How abstract machines implement head linear reduction (2003) (unpublished)"},{"key":"23_CR10","first-page":"71","volume":"106","author":"N.G. Bruijn de","year":"1987","unstructured":"de Bruijn, N.G.: Generalizing Automath by means of a lambda-typed lambda calculus. Mathematical Logic and Theoretical Computer Science\u00a0106, 71\u201392 (1987)","journal-title":"Mathematical Logic and Theoretical Computer Science"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Inf. Comput.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inf. Comput."},{"key":"23_CR12","unstructured":"Greenland, W.: Game semantics for region analysis. PhD thesis, University of Oxford (2004)"},{"key":"23_CR13","unstructured":"Harmer, R.: Innocent game semantics. Lecture notes (2004-2007)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Harmer, R., Hyland, M., Melli\u00e8s, P.-A.: Categorical combinatorics for innocent strategies. In: IEEE Symposium on Logic in Computer Science, pp. 379\u2013388 (2007)","DOI":"10.1109\/LICS.2007.14"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: IEEE Symposium on Logic in Computer Science, pp. 422\u2013430 (1999)","DOI":"10.1109\/LICS.1999.782637"},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Luke Ong, C.-H.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"23_CR17","unstructured":"Krivine, J.-L.: Un interpr\u00e9teur du \u03bb-calcul (1985) (unpublished)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-87531-4_18","volume-title":"Computer Science Logic","author":"U. Lago Dal","year":"2008","unstructured":"Dal Lago, U., Laurent, O.: Quantitative game semantics for linear logic. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 230\u2013245. Springer, Heidelberg (2008)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Laird, J.: Full abstraction for functional languages with control. In: IEEE Symposium on Logic in Computer Science, pp. 58\u201367 (1997)","DOI":"10.1109\/LICS.1997.614931"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J. Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous \u03c0-calculus. In: Jayaraman, K., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 51\u201365. Springer, Heidelberg (2005)"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(94)90263-1","volume":"135","author":"G. Mascari","year":"1994","unstructured":"Mascari, G., Pedicini, M.: Head linear reduction and pure proof net extraction. Theoretical Computer Science\u00a0135(1), 111\u2013137 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2845","volume":"160","author":"G. McCusker","year":"2000","unstructured":"McCusker, G.: Games and Full Abstraction for FPC. Information and Computation\u00a0160(1-2), 1\u201361 (2000)","journal-title":"Information and Computation"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Nakajima, R.: Infinite normal forms for the \u03bb-calculus. In: \u03bb-Calculus and Computer Science Theory, pp. 62\u201382 (1975)","DOI":"10.1007\/BFb0029519"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/S0049-237X(09)70143-0","volume":"110","author":"H. Schwichtenberg","year":"1982","unstructured":"Schwichtenberg, H.: Complexity of normalization in the pure typed lambda-calculus. Studies in Logic and the Foundations of Mathematics\u00a0110, 453\u2013457 (1982)","journal-title":"Studies in Logic and the Foundations of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T07:09:42Z","timestamp":1741072182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}