Universal coalgebra is a mathematical theory of state based systems, which in many respects is dual to universal algebra. Equality must be replaced by indistinguishability. Coinduction replaces induction as a proof principle and maps are defined by co-recursion. In this (entirely self-contained) paper we give a first glimpse at the general theory and focus on some applications in Computer Science.
@article{1698,
title = {State based systems are coalgebras},
journal = {CUBO, A Mathematical Journal},
volume = {5},
year = {2003},
language = {en},
url = {http://dml.mathdoc.fr/item/1698}
}
Peter Gumm, H. State based systems are coalgebras. CUBO, A Mathematical Journal, Tome 5 (2003) . http://gdmltest.u-ga.fr/item/1698/