In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coprodu...
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...