Types and coalgebraic structure
✍ Scribed by H. Peter Gumm; Tobias Schröder
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 275 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an element of the ÿnal coalgebra) turns out to represent a new coalgebra At. The universal property of this family of coalgebras, resembling freeness, is that for every state s of every system S there exists a
We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and co