Distributivity of categories of coalgebras

Authors:
H. Peter Gumm;Jesse Hughes;Tobias Schröder
Affiliations:
Philipps-Universität Marburg, Fachbereich Math. & Informatik, Hans Meerwein Strasse, Marburg, 35032 Germany;Katholieke Universiteit Nijmwegen, 6525 ED, Nijmwegen, The Netherlands;Lufthansa AG, Frankfurt/Main, Germany
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 0

Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Covarieties and complete covarieties

Theoretical Computer Science
On the structure of categories of coalgebras

Theoretical Computer Science
Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Initial Algebra and Final Coalgebra Semantics for Concurrency

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Behavioural differential equations: a coinductive calculus of streams, automata, and power series

Behavioural differential equations: a coinductive calculus of streams, automata, and power series
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science

Quantified Score

Hi-index	5.24

Visualization

Abstract

For any Set-endofunctor F, the category SetF of F-coalgebras has preimages, i.e. pullbacks along an injective map. If F preserves preimages, then SetF is distributive, and the converse holds, whenever SetF has finite products.