Search

• < Previous
• 1
• Next >

---

Corecursive Algebras, Corecursive Monads and Bloom Monads

Jiří Adámek ; Mahdie Haddadi ; Stefan Milius.

An algebra is called corecursive if from every coalgebra a unique coalgebra-to-algebra homomorphism exists into it. We prove that free corecursive algebras are obtained as coproducts of the terminal coalgebra (considered as an algebra) and free algebras. The monad of free corecursive algebras is&nbsp;[&hellip;]

---

Elgot Algebras

Jiri Adamek ; Stefan Milius ; Jiri Velebil.

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories instead, i.e., theories in which abstract recursive&nbsp;[&hellip;]

---

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence

Thorsten Wißmann ; Stefan Milius ; Lutz Schröder.

We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by working with coalgebras for a set functor in the&nbsp;[&hellip;]

---