μ-Bicomplete categories and parity games

RAIRO - Theoretical Informatics and Applications

Volumn 36, Issue 2, 2002, Pages 195-227

  Santocanale, Luigi ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Bicomplete categories; Final coalgebras; Inductive and coinductive types; Initial algebras; Parity games

Indexed keywords

ALGEBRA; FUNCTIONS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

COALGEBRAS; PARITY GAMES;

GAME THEORY;

EID: 14244273693     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2002010     Document Type: Article

References (35)

1. P. Aczel, Non-well-founded sets. Stanford University Center for the Study of Language and Information, Stanford, CA (1988).
2. P. Aczel, J. Adámek 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).
3. J. Adámek and V. Koubek, Least fixed point of a functor. J. Comput. System Sci. 19 (1979) 163-178.
4. J. Adámek and J. Rosický, Locally presentable and accessible categories. Cambridge University Press, Cambridge (1994).
5. A. Arnold and D. Niwinski, Rudiments of mu-calculus. Elsevier, North-Holland, Stud. Logic Found. Math. 146 (2001).
6. M. Barr, Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114 (1993) 299-315.
7. S.L. Bloom and Z. Ésik, Iteration theories. Springer-Verlag, Berlin (1993). The equational logic of iterative processes.
8. S.L. Bloom, Z. Ésik, A. Labella and E.G. Manes, Iteration 2-theories. Appl. Categ. Structures 9 (2001) 173-216.
9. J.R.B. Cockett and D. Spencer, Strong categorical datatypes. I, in Category theory 1991 (Montreal, PQ, 1991). Providence, RI, Amer. Math. Soc. (1992) 141-169.
10. J.R.B. Cockett and D. Spencer, Strong categorical datatypes. II. A term logic for categorical programming. Theoret. Comput. Sci. 139 (1995) 69-113.
11. R. Cockett and T. Fukushima, About Charity, Yellow Series Report No. 92/480/18. Department of Computer Science, The University of Calgary (1992).
12. E.A. Emerson and C.S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), in 32nd Annual Symposium on Foundations of Computer Science. IEEE (1991) 368-377.
13. E.A. Emerson, C.S. Jutla and A.P. Sistla, On model checking for the μ-calculus and its fragments. Theoret. Comput. Sci. 258 (2001) 491-522.
14. Z. Ésik and A. Labella, Equational properties of iteration in algebraically complete categories. Theoret. Comput. Sci. 195 (1998) 61-89. Mathematical foundations of computer science, Cracow (1996).
15. P. Freyd, Algebraically complete categories, in Category theory (Como, 1990). Springer, Berlin (1991) 95-104.
16. E. Giménez, A tutorial on recursive types in Coq. Technical Report 0221, INRIA (1998).
17. J.M.E. Hyland, The effective topos, in The L.E.J. Brouwer Centenary Symposium (Noordwijkerhout, 1981). North-Holland, Amsterdam (1982) 165-216.
18. A. Joyal, Free bicomplete categories. C. R. Math. Rep. Acad. Sci. Canada 17 (1995) 219-224.
19. A. Joyal, Free lattices, communication and money games, in Logic and scientific methods (Florence, 1995). Kluwer Acad. Publ., Dordrecht (1997) 29-68.
20. G.M. Kelly, Elementary observations on 2-categorical limits. Bull. Austral. Math. Soc. 39 (1989) 301-317.
21. J. Lambek, A fixpoint theorem for complete categories. Math. Z. 103 (1968) 151-161.
22. D.J. Lehmann and M.B. Smyth, Algebraic specification of data types: A synthetic approach. Math. Systems Theory 14 (1981) 97-139.
23. M. Makkai and R. Paré, Accessible categories: The foundations of categorical model theory. American Mathematical Society, Providence, RI (1989).
24. R. McNaughton, Infinite games played on finite graphs. Ann. Pure Appl. Logic 65 (1993) 149-184.
25. A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, in Computation theory (Zaborów, 1984). Springer, Berlin, Lecture Notes in Comput. Sci. 208 (1985) 157-168.
26. D. Niwiński, Equational μ-calculus, in Computation theory (Zaborów, 1984). Springer, Berlin, Lecture Notes in Comput. Sci. 208 (1985) 169-176.
27. C. Reutenauer, Ensembles libres de chemins dans un graphe. Bull. Soc. Math. France 114, (1986) 135-152.
28. J.J.M.M. Rutten, Universal coalgebra: A theory of systems. Theoret. Comput. Sci. 249 (2000) 3-80.
29. L. Santocanale, The alternation hierarchy for the theory of μ-lattices. Theory Appl. Categ. 9 (2002) 166-197. A special volume of articles from the Category Theory 2000 Conference (CT2000).
30. L. Santocanale, A calculus of circular proofs and its categorical semantics, in FOSSACS02, Foundations of Software Science and Computation Structures. Springer-Verlag, Lecture Notes Comput. Sci. 2303 (2002) 357-371.
31. L. Santocanale, Free μ-lattices. J. Pure Appl. Algebra 168 (2002) 227-264. Category theory 1999 (Coimbra).
32. A.K. Simpson and G.D. Plotkin, Complete axioms for categorical fixed-point operators, in Proc. of 15th Annual Symposium on Logic in Computer Science (2000) 30-41.
33. W. Thomas, Languages, automata, and logic edited by G. Rozenberg and A. Salomaa. Springer-Verlag, New York, Handbook of Formal Language Theory III (1996).
34. I. Walukiewicz, Pushdown processes: Games and model-checking. Inform. and Comput. 164 (2001) 234-263. FLOC '96 (New Brunswick, NJ).
35. W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200 (1998) 135-183.