Initial algebra and final coalgebra semantics for concurrency [chapter]

Jan Rutten, Daniele Turi
1994 Lecture Notes in Computer Science  
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.
doi:10.1007/3-540-58043-3_28 fatcat:b2xkcfzdj5ff3k5opwvojjfghq