BibTeX
@MISC{Rutten00universalcoalgebra:,
author = {J. J. M. M. Rutten},
title = {Universal coalgebra: a theory of systems},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certain types of automata and more generally, for (transition and dynamical) systems. An important property of initial algebras is that they satisfy the familiar principle of induction. Such a principle was missing for coalgebras until the work of Aczel (Non-Well-Founded sets, CSLI Leethre Notes, Vol. 14, center for the study of Languages and information, Stanford, 1988) on a theory of non-wellfounded sets, in which he introduced a proof principle nowadays called coinduction. It was formulated in terms of bisimulation, a notion originally stemming from the world of concurrent programming languages. Using the notion of coalgebra homomorphism, the definition of bisimulation on coalgebras can be shown to be formally dual to that of congruence on algebras. Thus, the three basic notions of universal algebra: algebra, homomorphism of algebras, and congruence, turn out to correspond to coalgebra, homomorphism of coalgebras, and bisimulation, respectively. In this paper, the latter are taken
Keyphrases
universal coalgebra initial algebra familiar principle basic notion certain type csli leethre note non-well-founded set nite data type finite data type finite list concurrent programming language proof principle nowadays non-wellfounded set important property coalgebra homomorphism later final coalgebras universal algebra
