Recursive coalgebras of finitary functors

DOI10.1051/ITA:2007028zbMath1147.18001OpenAlexW2133393261MaRDI QIDQ3512598

Dominik Lücke, Stefan Milius, Jiří Adámek

Publication date: 21 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_4_447_0

zbMATH Keywords

coalgebrarecursive coalgebradefinition by recursivity

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categories of algebras (08C05) Functor categories, comma categories (18A25) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (6)

Coequational logic for accessible functors ⋮ Recursive coalgebras of finitary functors ⋮ Well-founded coalgebras, revisited ⋮ Optimal Coin Flipping ⋮ A Coalgebraic View of Bar Recursion and Bar Induction ⋮ Coequational Logic for Finitary Functors

Cites Work

• Universal coalgebra: A theory of systems
• Completely iterative algebras and completely iterative monads
• Categorical set theory: A characterization of the category of sets
• Terminal coalgebras in well-founded set theory
• Recursive coalgebras from comonads
• Terminal coalgebras and free iterative theories
• A fixpoint theorem for complete categories
• Recursive coalgebras of finitary functors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive coalgebras of finitary functors