Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
An algebraic approach to deduction in equational partial horn theories
Journal of Information Processing and Cybernetics
Equational and implicational classes of coalgebras
Theoretical Computer Science
CSP, partial automata, and coalgebras
Theoretical Computer Science
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
A (Co)algebraic analysis of synchronization in CSP
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
| Hi-index | 0.00 |
The paper investigates the construction of cofree coalgebras for ‘unsorted signature morphisms'. Thanks to the perfect categorical duality between the traditional concept of equations and the concept of coequations developed in [14] we can fully take profit of the methodological power of Category Theory [2] and follow a clean three step strategy: Firstly, we analyse the traditional Birkhoff construction of free algebras and reformulate it in a systematic categorical way. Then, by dualizing the Birkhoff construction, we obtain, in a second step, corresponding results for cofree coalgebras. And, thirdly, we will interpret the new “abstract” categorical results in terms of more familiar concept. The analysis of a sample cofree construction will provide, finally, some suggestions concerning the potential rôle of cofree coalgebras in System Specifications.