{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:29:31Z","timestamp":1723418971017},"reference-count":35,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1051\/ita:2002010","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T16:49:42Z","timestamp":1068828582000},"page":"195-227","source":"Crossref","is-referenced-by-count":17,"title":["<i>\u03bc<\/i>-Bicomplete Categories and Parity Games"],"prefix":"10.1051","volume":"36","author":[{"given":"Luigi","family":"Santocanale","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2002,12,15]]},"reference":[{"key":"R1","unstructured":"P. Aczel,Non-well-founded sets. Stanford University Center for the Study of Language and Information, Stanford, CA (1988)."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"P. Aczel, J. Ad\u00e1mek and J. Velebil,A coalgebraic view of infinite trees and iteration, edited by M.L.A. Corradini and U. Montanari. Elsevier Science Publishers,Electron. Notes in Theoret. Comput. Sci.44(2001).","DOI":"10.1016\/S1571-0661(04)80900-9"},{"key":"R3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"Ad\u00e1mek","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"J. Ad\u00e1mek and J. Rosick\u00fd,Locally presentable and accessible categories. Cambridge University Press, Cambridge (1994).","DOI":"10.1017\/CBO9780511600579"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"A. Arnold and D. Niwinski,Rudiments of mu-calculus. Elsevier, North-Holland,Stud. Logic Found. Math.146(2001).","DOI":"10.1016\/S0049-237X(01)80001-X"},{"key":"R6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"Barr","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik,Iteration theories. Springer-Verlag, Berlin (1993). The equational logic of iterative processes.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"R8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1008708924144","volume":"9","author":"Bloom","year":"2001","journal-title":"Appl. Categ. Structures"},{"key":"R9","unstructured":"J.R.B. Cockett and D. Spencer, Strong categorical datatypes. I, inCategory theory 1991 (Montreal, PQ, 1991). Providence, RI,Amer. Math. Soc.(1992) 141-169."},{"key":"R10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00099-5","volume":"139","author":"Cockett","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"R11","unstructured":"R. Cockett and T. Fukushima,About Charity, Yellow Series Report No. 92\/480\/18. Department of Computer Science, The University of Calgary (1992)."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and C.S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), in32nd Annual Symposium on Foundations of Computer Science. IEEE (1991) 368-377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"R13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"Emerson","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0304-3975(97)00158-8","volume":"195","author":"\u00c9sik","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"P. Freyd, Algebraically complete categories, inCategory theory (Como, 1990). Springer, Berlin (1991) 95-104.","DOI":"10.1007\/BFb0084215"},{"key":"R16","unstructured":"E. Gim\u00e9nez,A tutorial on recursive types in Coq. Technical Report 0221, INRIA (1998)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland, The effective topos, inThe L.E.J. Brouwer Centenary Symposium (Noordwijkerhout, 1981). North-Holland, Amsterdam (1982) 165-216.","DOI":"10.1016\/S0049-237X(09)70129-6"},{"key":"R18","first-page":"219","volume":"17","author":"Joyal","year":"1995","journal-title":"C. R. Math. Rep. Acad. Sci. Canada"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"A. Joyal, Free lattices, communication and money games, inLogic and scientific methods (Florence, 1995). Kluwer Acad. Publ., Dordrecht (1997) 29-68.","DOI":"10.1007\/978-94-017-0487-8_3"},{"key":"R20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/S0004972700002781","volume":"39","author":"Kelly","year":"1989","journal-title":"Bull. Austral. Math. Soc."},{"key":"R21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"Lambek","year":"1968","journal-title":"Math. Z."},{"key":"R22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. Systems Theory"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"M. Makkai and R. Par\u00e9,Accessible categories: The foundations of categorical model theory. American Mathematical Society, Providence, RI (1989).","DOI":"10.1090\/conm\/104"},{"key":"R24","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"McNaughton","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, inComputation theory (Zabor\u00f3w, 1984). Springer, Berlin,Lecture Notes in Comput. Sci.208(1985) 157-168.","DOI":"10.1007\/3-540-16066-3_15"},{"key":"R26","unstructured":"D. Niwinski, Equational\u00b5-calculus, inComputation theory (Zabor\u00f3w, 1984). Springer, Berlin,Lecture Notes in Comput. Sci.208(1985) 169-176."},{"key":"R27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.24033\/bsmf.2051","volume":"114","author":"Reutenauer","year":"1986","journal-title":"Bull. Soc. Math. France"},{"key":"R28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"Rutten","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"R29","first-page":"166","volume":"9","author":"Santocanale","year":"2002","journal-title":"Theory Appl. Categ."},{"key":"R30","doi-asserted-by":"crossref","unstructured":"L. Santocanale, A calculus of circular proofs and its categorical semantics, inFOSSACS02, Foundations of Software Science and Computation Structures. Springer-Verlag,Lecture Notes Comput. Sci.2303(2002) 357-371.","DOI":"10.1007\/3-540-45931-6_25"},{"key":"R31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0022-4049(01)00098-6","volume":"168","author":"Santocanale","year":"2002","journal-title":"J. Pure Appl. Algebra"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"A.K. Simpson and G.D. Plotkin, Complete axioms for categorical fixed-point operators, inProc. of 15th Annual Symposium on Logic in Computer Science(2000) 30-41.","DOI":"10.1109\/LICS.2000.855753"},{"key":"R33","unstructured":"W. Thomas,Languages, automata, and logicedited by G. Rozenberg and A. Salomaa. Springer-Verlag, New York,Handbook of Formal Language TheoryIII(1996)."},{"key":"R34","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"Walukiewicz","year":"2001","journal-title":"Inform. and Comput."},{"key":"R35","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"Zielonka","year":"1998","journal-title":"Theoret. Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:01:47Z","timestamp":1585263707000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":35,"journal-issue":{"issue":"2"},"alternative-id":["ita0218"],"URL":"https:\/\/doi.org\/10.1051\/ita:2002010","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}