Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

μ -bicomplete categories and parity games

Luigi Santocanale — 2002

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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...

-Bicomplete Categories and Parity Games

Luigi Santocanale — 2010

RAIRO - Theoretical Informatics and Applications

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, 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...

Page 1

Download Results (CSV)