Complete sets of cooperations

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.

[1]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[2]  Grigore Rosu,et al.  Circular Coinduction , 2000 .

[3]  Alexandra Silva,et al.  Behavioural Differential Equations and Coinduction for Binary Trees , 2007, WoLLIC.

[4]  Jeffrey Shallit,et al.  The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[5]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[6]  Martín Hötzel Escardó,et al.  Calculus in coinductive form , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[7]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[8]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[9]  Grigore Rosu,et al.  Conditional Circular Coinductive Rewriting with Case Analysis , 2002, WADT.

[10]  H. Peter Gumm,et al.  On Minimal Coalgebras , 2008, Appl. Categorical Struct..

[11]  Rolf Hennicker,et al.  Context induction: A proof principle for behavioural abstractions and algebraic implementations , 1991, Formal Aspects of Computing.

[12]  Edsger W. Dijkstra,et al.  Selected Writings on Computing: A personal Perspective , 1982, Texts and Monographs in Computer Science.

[13]  Jan J. M. M. Rutten,et al.  Observational Coalgebras and Complete Sets of Co-operations , 2008, CMCS.

[14]  H. Gumm Elements Of The General Theory Of Coalgebras , 1999 .

[15]  Corina Cîrstea A coalgebraic equational approach to specifying observational structures , 2002, Theor. Comput. Sci..

[16]  Corina Cîrstea,et al.  Coalgebra semantics for hidden algebra: Parameterised objects an inheritance , 1997, WADT.

[17]  Michel Bidoit,et al.  Observer Complete Definitions are Behaviourally Coherent , 1999 .

[18]  Jan Willem Klop,et al.  Productivity of stream definitions , 2007, Theor. Comput. Sci..