Languages for Coalgebras on Datafunctors
Martin Rößiger · Electronic Notes in Theoretical Computer Science · 1999
We investigate languages to describe coalgebras on datafunctors. First, a syntactical characterization of a given datafunctor F leads to a functional description of the terminal F-coalgebra. It also provides an infinitary modal language Download : Download full-size imageF∞ for F-coalgebras. Bisimilarity coincides with logical equivalence. For the finitary fragment Download : Download full-size imageFω0 of Download : Download full-size imageF∞ a complete axiomatization for suitably restricted datafunctors F is presented. We discuss the relationship with the coalgebraic logic Download : Download full-size imageF by L. Moss [Mos97]. In case F is a datafunctor we give translations from Download : Download full-size imageF into Download : Download full-size imageF∞ and vice versa.