{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:37Z","timestamp":1759637617727,"version":"3.40.2"},"reference-count":20,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1051\/ita\/2012001","type":"journal-article","created":{"date-parts":[[2012,3,4]],"date-time":"2012-03-04T00:02:07Z","timestamp":1330819327000},"page":"231-259","source":"Crossref","is-referenced-by-count":4,"title":["Equivalences and Congruences on Infinite Conway Games"],"prefix":"10.1051","volume":"46","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":"250","published-online":{"date-parts":[[2012,3,2]]},"reference":[{"key":"R1","unstructured":"Abramsky S. and Jagadesaan R., Games and full completeness for multiplicative linear logic,J. Symb. Log.59(1994) 543\u2013574."},{"key":"R2","unstructured":"P. Aczel, Non-wellfounded sets.CSLI Lecture Notes14(1988)."},{"key":"R3","unstructured":"J. Barwise and L. Moss, Vicious Circles.CSLI Lecture Notes60(1996)."},{"key":"R4","unstructured":"E. Berlekamp, J. Conway and R. Guy,Winning Ways. Academic Press (1982)."},{"key":"R5","unstructured":"J.H. Conway,On Numbers and Games, 2nd edition (1st edition by Academic Press (1976). AK Peters Ltd. (2001)."},{"key":"R6","unstructured":"Forti M. and Honsell F., Set-theory with free construction principles.Ann. Scuola Norm. Sup. Pisa Cl. Sci.10(1983) 493\u2013522."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Grumberg O., Lange M., Leucker M. and Shoham S., When not losing is better than winning : abstraction and refinement for the full\u03bc-calculus.Inform. Comput.205(2007) 1130\u20131148.","DOI":"10.1016\/j.ic.2006.10.009"},{"key":"R8","unstructured":"Grundy P.M., Mathematics and games.Eureka2(1939) 6\u20138."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"F. Honsell and M. Lenisa, Conway Games, algebraically and coalgebraically.Log. Meth. Comput. Sci.7(2011).","DOI":"10.2168\/LMCS-7(3:8)2011"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"M. Hyland and A. Schalk, Games on Graphs and Sequentially Realizable Functionals, inProc. of LICS\u201902. IEEE Computer Science Press (2002) 257\u2013264.","DOI":"10.1109\/LICS.2002.1029834"},{"key":"R11","unstructured":"Kissig C. and Venema Y., Complementation of Coalgebra Automata, inProc. of CALCO\u201909.Lect. Notes Comput. Sci.5728(2009) 81\u201396."},{"key":"R12","unstructured":"Jacobs B. and Rutten J.J.M.M., A Tutorial on (Co)algebras and (Co)induction.Bull. of EATCS62(1997) 222\u2013259."},{"key":"R13","unstructured":"A. Joyal, Remarques sur la th\u00e9orie des jeux \u00e0 deux personnes.Gaz. Sci. Math. du Qu\u00e9bec1(1977)."},{"key":"R14","unstructured":"P.L. Curien, H. Herbelin, J.L. Krivine and P.A. Melli\u00e8s, Categorical semantics of linear logic, in Interactive models of computation and program behaviour.Panoramas et Synth\u00e8ses, Soci\u00e9t\u00e9 Math\u00e9matique de France27(2009)."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"P.A. Melli\u00e8s, N. Tabareau and C. Tasson, An explicit formula for the free exponential modality of linear logic, inProc. of ICALP\u201909.Lect. Notes Comput. Sci.555(2009).","DOI":"10.1007\/978-3-642-02930-1_21"},{"key":"R16","unstructured":"M. Pauly, From Programs to Games : Invariance and Safety for Bisimulation, inProc. of CSL\u201909(2009) 485\u2013496."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Santocanale L., Free\u03bc-lattices.J. Pure Appl. Algebra168(2002) 227\u2013264.","DOI":"10.1016\/S0022-4049(01)00098-6"},{"key":"R18","unstructured":"Sprague R., \u00dcber mathematische kampfspiele.Tohoku Math. J.41(1935) 438\u2013444."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Thomas W., Infinite games and verification, inProc. of CAV\u201902.Lect. Notes Comput. Sci.2404(2002) 58\u201364.","DOI":"10.1007\/3-540-45657-0_5"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"J. van Benthem, Extensive games as process models,J. Log. Lang. Inf.11(2002).","DOI":"10.1023\/A:1015534111901"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2012001\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:42:07Z","timestamp":1742636527000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2012001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,2]]},"references-count":20,"journal-issue":{"issue":"2"},"alternative-id":["ita100063"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2012001","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2012,3,2]]}}}