{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T11:40:10Z","timestamp":1743939610744,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_45","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"503-515","source":"Crossref","is-referenced-by-count":3,"title":["Categories of Coalgebraic Games"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rekha","family":"Redamalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Semantics of Interaction: an introduction to Game Semantics. In: Dybjer, P., et al. (eds.) CLiCS 1996 School. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511526619.002"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163, 404\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"45_CR3","unstructured":"Aczel, P.: Non-wellfounded sets. CSLI Lecture Notes, Stanford, vol.\u00a014 (1988)"},{"key":"45_CR4","unstructured":"Barwise, J., Moss, L.: Vicious Circles. CSLI Lecture Notes, Stanford, vol.\u00a060 (1996)"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: Extensive games as process models. Journal of Logic, Language and Information\u00a011 (2002)","DOI":"10.1023\/A:1015534111901"},{"key":"45_CR6","unstructured":"Berlekamp, E., Conway, J., Guy, R.: Winning Ways. Academic Press (1982)"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Conway, J.H.: On Numbers and Games. A K Peters Ltd. (2001)","DOI":"10.1201\/9781439864159"},{"issue":"4","key":"45_CR8","first-page":"493","volume":"10","author":"M. Forti","year":"1983","unstructured":"Forti, M., Honsell, F.: Set-theory with free construction principles. Ann. Scuola Norm. Sup. Pisa, Cl. Sci.\u00a010(4), 493\u2013522 (1983)","journal-title":"Ann. Scuola Norm. Sup. Pisa, Cl. Sci."},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Honsell, F., Lenisa, M.: Conway Games, algebraically and coalgebraically. Logical Methods in Computer Science\u00a07(3) (2011)","DOI":"10.2168\/LMCS-7(3:8)2011"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Honsell, F., Lenisa, M., Redamalla, R.: Equivalences and Congruences on Infinite Conway Games. In: Theoretical Informatics and Applications (2012)","DOI":"10.1051\/ita\/2012001"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Hyland, M., Schalk, A.: Games on Graphs and Sequentially Realizable Functionals. In: LICS 2002, pp. 257\u2013264. IEEE Computer Science Press (2002)","DOI":"10.1109\/LICS.2002.1029834"},{"key":"45_CR12","unstructured":"Joyal, A.: Remarques sur la Theorie des Jeux a deux personnes. Gazette des Sciences Mathematiques du Quebec\u00a01(4) (1977)"},{"key":"45_CR13","unstructured":"Mellies, P.A.: Categorical semantics of linear logic. In: Panoramas et Synth\u00e9ses, vol.\u00a027, Soci\u00e9t\u00e9 Math\u00e9matique de France (2009)"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02930-1_21","volume-title":"Automata, Languages and Programming","author":"P.-A. Melli\u00e8s","year":"2009","unstructured":"Melli\u00e8s, P.-A., Tabareau, N., Tasson, C.: An Explicit Formula for the Free Exponential Modality of Linear Logic. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 247\u2013260. Springer, Heidelberg (2009)"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Pauly, M.: From Programs to Games: Invariance and Safety for Bisimulation. In: CSL 2009, pp. 485\u2013496 (2009)","DOI":"10.1007\/3-540-44622-2_33"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0022-4049(01)00098-6","volume":"168","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: Free \u03bc-lattices. J. Pure Appl. Algebra\u00a0168, 227\u2013264 (2002)","journal-title":"J. Pure Appl. Algebra"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T11:21:56Z","timestamp":1743938516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}