Specifying Coalgebras with Modal Logic
Document Type
Article
Publication Date
1998
Abstract
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming. Two approaches are taken: First, standard concepts of modal logic are applied to coalgebras. For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Second, we discuss the relationship of this approach with the coalgebraic logic of Moss [6].
Recommended Citation
A. Kurz, “Specifying Coalgebras with Modal Logic,” Electronic Notes in Theoretical Computer Science, vol. 11, pp. 56–70, 1998. DOI: 10.1016/S1571-0661(04)00053-2
Copyright
Elsevier
Comments
This article was originally published in Electronic Notes in Theoretical Computer Science, volume 11, in 1998. DOI: 10.1016/S1571-0661(04)00053-2