Types and coalgebraic structure
From MaRDI portal
Publication:2577729
DOI10.1007/s00012-005-1888-2zbMath1086.08002OpenAlexW2025303167MaRDI QIDQ2577729
Tobias Schröder, H. Peter Gumm
Publication date: 6 January 2006
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-005-1888-2
Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of machines, automata (18B20)
Related Items (19)
Minimality Notions via Factorization Systems and Examples ⋮ Iterated covariant powerset is not a monad ⋮ Quotients of Bounded Natural Functors ⋮ Free-lattice functors weakly preserve epi-pullbacks ⋮ Coalgebras, Chu spaces, and representations of physical systems ⋮ On universal categories of coalgebras ⋮ The \({\mathcal {HS}} = {\mathcal {SH}}\) problem for coalgebras ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Unnamed Item ⋮ On minimal coalgebras ⋮ Some facets of Horn covarieties in a category ⋮ Rigidity of unary algebras and its application to the \({\mathcal {HS} = \mathcal {SH}}\) problem ⋮ Algebraic lattices and locally finitely presentable categories ⋮ Transitivity and Difunctionality of Bisimulations ⋮ Copower functors ⋮ Terminal Sequence Induction via Games ⋮ Weak homomorphisms of coalgebras beyond \(\mathsf{Set}\) ⋮ Connected monads weakly preserve products ⋮ On Products of Transition Systems
This page was built for publication: Types and coalgebraic structure
