Recursive Specification of Data Types
Part of the Texts and Monographs in Computer Science book series (MCS)
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”
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.Google Scholar
© Springer-Verlag New York Inc. 1986