Initial algebras and terminal coalgebras in many-sorted sets

DOI10.1017/S0960129510000502zbMath1214.68227OpenAlexW2143507585MaRDI QIDQ3005994

Jiří Adámek, Věra Trnková

Publication date: 10 June 2011

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129510000502

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (8)

Fixed points of set functors: how many iterations are needed? ⋮ Unnamed Item ⋮ Relatively terminal coalgebras ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Fixed Points of Functors - A Short Abstract ⋮ On final coalgebras of power-set functors and saturated trees ⋮ Unnamed Item ⋮ Strong functors on many-sorted sets

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

This page was built for publication: Initial algebras and terminal coalgebras in many-sorted sets