Recursive data types in algebraically \(\omega\)-complete categories

DOI10.1006/INCO.1995.1061zbMath0841.18003OpenAlexW2055348826MaRDI QIDQ1892884

Jiří Adámek

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1061

zbMATH Keywords

least fixpointalgebraically compactalgebraically \(\omega\)-completealgebraically completelargest fixpoint

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Data structures (68P05) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of machines, automata (18B20)

Related Items (5)

Unnamed Item ⋮ Join inverse categories and reversible recursion ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ Inversion, Iteration, and the Art of Dual Wielding ⋮ Unnamed Item

This page was built for publication: Recursive data types in algebraically \(\omega\)-complete categories