{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:20Z","timestamp":1794381080587,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_24","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"257-268","source":"Crossref","is-referenced-by-count":4,"title":["Projecting Games on Hypercoherences"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Boudes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. In: Theoretical Aspects of Computer Software, pp. 1\u201315 (1994)","DOI":"10.1007\/3-540-57887-0_87"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/BFb0028007","volume-title":"Computer Science Logic","author":"P. Baillot","year":"1998","unstructured":"Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: Timeless games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 56\u201377. Springer, Heidelberg (1998)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science\u00a020, 265\u2013321 (1982)","journal-title":"Theoretical Computer Science"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014046","volume-title":"Typed Lambda Calculi and Applications","author":"G.M. Bierman","year":"1995","unstructured":"Bierman, G.M.: What is a categorical model of intuitionistic linear logic? In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, Springer, Heidelberg (1995)"},{"key":"24_CR5","volume-title":"Electronic Notes in Theoretical Computer Science","author":"P. Boudes","year":"2003","unstructured":"Boudes, P.: Non uniform hypercoherences. In: Blute, R., Selinger, P. (eds.) Electronic Notes in Theoretical Computer Science, vol.\u00a069, Elsevier, Amsterdam (2003)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Bucciarelli, A., Ehrhard, T.: Sequentiality in an extensional framework. Information and Computation 110(2) (1994)","DOI":"10.1006\/inco.1994.1033"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Ehrhard, T.: Hypercoherences: a strongly stable model of linear logic. Mathematical Structures in Computer Science 3 (1993)","DOI":"10.1017\/S0960129500000281"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Ehrhard, T.: A relative definability result for strongly stable functions and some corollaries. Information and Computation 152 (1999)","DOI":"10.1006\/inco.1998.2781"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(00)00173-0","volume":"247","author":"T. Ehrhard","year":"2000","unstructured":"Ehrhard, T.: Parallel and serial hypercoherences. Theoretical computer science\u00a0247, 39\u201381 (2000)","journal-title":"Theoretical computer science"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"24_CR12","unstructured":"Laird, J.: Games and sequential algorithms. Available by http (2001)"},{"key":"24_CR13","unstructured":"Lamarche, F.: Sequentiality, games and linear logic (announcement). In: Workshop on Categorical Logic in Computer Science. Publications of the Computer Science Department of Aarhus University, DAIMI PB-397-II (1992)"},{"key":"24_CR14","unstructured":"Laurent, O.: \u00c9tude de la polarisation en logique. Th\u00e8se de doctorat, Universit\u00e9 Aix-Marseille II (March 2002)"},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/LICS.2002.1029835","volume-title":"Proceedings of the seventeenth annual IEEE symposium on Logic In Computer Science","author":"O. Laurent","year":"2002","unstructured":"Laurent, O.: Polarized games (extended abstract). In: Proceedings of the seventeenth annual IEEE symposium on Logic In Computer Science, July 2002, pp. 265\u2013274. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"1-3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(01)00110-5","volume":"117","author":"J.R. Longley","year":"2002","unstructured":"Longley, J.R.: The sequentially realizable functionals. Annals of Pure and Applied Logic\u00a0117(1-3), 1\u201393 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"24_CR17","unstructured":"Melli\u00e8s, P.-A.: Sequential algorithms and strongly stable functions. To appear in the special issue of TCS: Game Theory Meets Theoretical Computer Science (2003)"},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ic.2003.10.003","volume":"189","author":"P.-A. Melli\u00e8s","year":"2004","unstructured":"Melli\u00e8s, P.-A.: Comparing hierarchies of types in models of linear logic. Information and Computation\u00a0189(2), 202\u2013234 (2004)","journal-title":"Information and Computation"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S096012950000311X","volume":"11","author":"P. Selinger","year":"2001","unstructured":"Selinger, P.: Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science\u00a011, 207\u2013260 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"24_CR20","unstructured":"van Oosten, J.: A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht (1997)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:52Z","timestamp":1605741832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_24","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}