Functors for coalgebras
Applications of universal algebra in computer science (08A70) Categories of algebras (08C05) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical semantics of formal languages (18C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Coalgebras have been introduced by \textit{P. Aczel} and \textit{N. Mendler} [Lect. Notes Comput. Sci. 389, 357-365 (1989; Zbl 0712.68006)] to model various types of transition systems. Giving a functor \(T\) from \textbf{Set}, the category of sets, to itself, a coalgebra of type \(T\) is a map \(\alpha : X \rightarrow T(X)\). Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. The author gives an easy criterion to check whether a functor preserves weak pullbacks. He applies this characterization to the functor which associates a set \(X\) with the set of all filters on \(X\). It turns out that this functor preserves weak pullbacks but not weak generalized pullbacks. Since topological spaces form coalgebras, he finds that intersection of subcoalgebras need not be a coalgebra and hence 1-generated subcoalgebras need not exist.
- Copower functors
- Coherent functors
- More existence theorems for recursion categories.
- On institutions for modular coalgebraic specifications.
- Coaction functors. II
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Families parametrized by coalgebras
- On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras
- Free-lattice functors weakly preserve epi-pullbacks
- Free-algebra functors from a coalgebraic perspective
- Connected monads weakly preserve products
- A simplification functor for coalgebras
- Coalgebras for fuzzy transition systems
- scientific article; zbMATH DE number 1722645 (Why is no real title available?)
- Modal predicates and coequations
- Abstract logics as dialgebras
- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- Lax Extensions of Coalgebra Functors
- Coaction functors
- Presentation of set functors: a coalgebraic perspective
- Recursive coalgebras of finitary functors
- scientific article; zbMATH DE number 1497876 (Why is no real title available?)
- scientific article; zbMATH DE number 1497879 (Why is no real title available?)
- Coalgebras of bounded type
- scientific article; zbMATH DE number 2104415 (Why is no real title available?)
- A Calculus of Terms for Coalgebras of Polynomial Functors
- Monoid-labeled transition systems
- Flatness properties of acts over semigroups
- On coalgebras and type transformations
- Algebra and Coalgebra in Computer Science
- On the final sequence of a finitary set functor
- Transitivity and difunctionality of bisimulations
- Equational and implicational classes of coalgebras
- Covarieties and complete covarieties
- Operators on classes of coalgebras
- Subsequential transducers: a coalgebraic perspective
- A complete inference system for skip-free guarded Kleene algebra with tests
- A coalgebraic view on positive modal logic
This page was built for publication: Functors for coalgebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950751)
