Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Selected writings on computing: a personal perspective
Selected writings on computing: a personal perspective
A coalgebraic equational approach to specifying observational structures
Theoretical Computer Science
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
Observational Coalgebras and Complete Sets of Co-operations
Electronic Notes in Theoretical Computer Science (ENTCS)
Behavioural differential equations and coinduction for binary trees
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the final coalgebra of automatic sequences
Logic and Program Semantics
Automatic Sequences and Zip-Specifications
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well known, but commonly elided. In this paper, we argue that any such concrete representation of a set as a final coalgebra is potentially interesting on its own. We discuss several examples, in particular, we consider different coalgebra structures that turn the set of infinite streams into the carrier of a final coalgebra. After that we focus on coalgebra structures that are made up using so-called cooperations. We say that a collection of cooperations is complete for a given set X if it gives rise to a coalgebra structure that turns X into the carrier set of a subcoalgebra of a final coalgebra. Any complete set of cooperations yields a coalgebraic proof and definition principle. We exploit this fact and devise a general definition scheme for constants and functions on a set X that is parametrical in the choice of the complete set of cooperations for X.