Abstract
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well.
Author supplied keywords
Cite
CITATION STYLE
Rutten, J., & Turi, D. (1994). Initial algebra and final coalgebra semantics for concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 803 LNCS, pp. 530–582). Springer Verlag. https://doi.org/10.1007/3-540-58043-3_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
