µ-Bicomplete Categories and Parity Games - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

µ-Bicomplete Categories and Parity Games

Résumé

For an arbitrary category, we consider the least class of functors con- taining 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 ex- amples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved through par- ity 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.
Fichier principal
Vignette du fichier
0.pdf (2.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01376731 , version 1 (20-10-2016)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Luigi Santocanale. µ-Bicomplete Categories and Parity Games. [Research Report] RR-1281-02, LaBRI - Laboratoire Bordelais de Recherche en Informatique. 2002. ⟨hal-01376731⟩
130 Consultations
40 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More