Initial algebras and terminal coalgebras in many-sorted sets
From MaRDI portal
Publication:3005994
DOI10.1017/S0960129510000502zbMath1214.68227MaRDI QIDQ3005994
Publication date: 10 June 2011
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
68Q65: Abstract data types; algebraic specification
Related Items
Unnamed Item, Unnamed Item, Strong functors on many-sorted sets, Fixed Points of Functors - A Short Abstract, Fixed points of set functors: how many iterations are needed?, Relatively terminal coalgebras, On final coalgebras of power-set functors and saturated trees
Cites Work
- Unnamed Item
- On the final sequence of a finitary set functor
- On the greatest fixed point of a set functor
- Solving reflexive domain equations in a category of complete metric spaces
- Categorical constructions of free algebras, colimits, and completions of partial algebras
- Banach's fixed-point theorem as a base for data-type equations
- Universal coalgebra: A theory of systems
- Completely iterative algebras and completely iterative monads
- Terminal coalgebras in well-founded set theory
- The Category-Theoretic Solution of Recursive Domain Equations