Arrow Research search
Back to TCS

TCS 2004

On coalgebra based on classes

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

The category Class of classes and functions is proved to have a number of properties suitable for algebra and coalgebra: every endofunctor is set-based, it has an initial algebra and a terminal coalgebra, the categories of algebras and coalgebras are complete and cocomplete, and every endofunctor generates a free completely iterative monad. A description of a terminal coalgebra for the power-set functor is provided.

Authors

Keywords

  • Category of classes
  • Set-based endofunctor
  • Terminal coalgebra
  • Iterative monad

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
122944187861883987
v2026.09.13