Abstract
Just as posets generalize categories, the Kleene fixed point theorem of 6.2.13 generalizes to provide a “co-continuous” endofunctor ψ: C→C with a least fixed point as the “colimit” of the “right chain”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes and References for Chapter 11
M. B. Smyth, “Category-theoretic solution of recursive domain equations,” in Theory of Computation Report No. 14, Department of Computer Science, University of Warwick, 1976.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Manes, E.G., Arbib, M.A. (1986). Recursive Specification of Data Types. In: Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4962-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9377-4
Online ISBN: 978-1-4612-4962-7
eBook Packages: Springer Book Archive