… : coalgebras, monads, algebras over a monad, distributive laws, and bialgebras. Unpointed
deterministic automata are basic examples of coalgebras in … Coalgebra has emerged as a …

… (1) We already know from [17] that assuming the quantale to be completely distributive
entails that each completely distributive Ω-category is also completely distributive as a lattice. To …

… In this paper, we take a coalgebraic outlook at the semantics … (4) Markov chains are coalgebras
for the distribution functor … that a “trivial” lifting and a corresponding distributive law of the …

… distributive if all joins in V distribute over all meets, equivalently all meets … a final chain
argument that allows us to detach the technical development from the choice of a fixed coalgebra: …

We study connections among polynomials, differential equations and streams over a field K,
in terms of algebra and coalgebra. We first introduce the class of (F,G)-products on streams, …

… chain of monads and comonads ([11]) on the various subcategories of algebras and coalgebras:
… In the table below, we list the identities characterising the algebras and coalgebras for a …

… in the sense of weak distributive laws. Notice however that alternating automata are
coalgebras for the functor 2 × (PP)A, and not just PP, which leads us to our next contribution. …

… into the coalgebraic framework, we make existing generic coalgebraic methods applicable for
… Every coalgebra defines a cone for the final chain in a canonical way. The core idea is that …

… Similarly, Markov chains, which are the simplest … distributive laws into computer science,
we explain how classical results of coalgebra theory can be adapted to weak distributive laws. …

… self-distributivity indeed produce interesting examples of self-distributive objects among
coalgebras. … The algebraic and geometric motivations and significance of the chain maps are …