RAIRO-Theor. Inf. Appl.
Volume 36, Number 2, April/June 2002Fixed Points in Computer Science (FICS'01)
|Page(s)||195 - 227|
|Published online||15 December 2002|
μ-Bicomplete Categories and Parity Games
LaBRI, Université Bordeaux 1,
351 cours de la Libération,
33405 Talence Cedex,
For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ-terms. We call the category μ-bicomplete if every μ-term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved through parity games: we associate to each game an algebraic expression and turn the game into a term of a categorical theory. We show that μ-terms and parity games are equivalent, meaning that they define the same property of being μ-bicomplete. Finally, the interpretation of a parity game in the category of sets is shown to be the set of deterministic winning strategies for a chosen player.
Mathematics Subject Classification: 18A30 / 68Q65 / 91A43
Key words: Parity games / bicomplete categories / initial algebras / final coalgebras / inductive and coinductive types.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.