Recursive Specification of Data Types

  • Ernest G. Manes
  • Michael A. Arbib
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 ψ: CC with a least fixed point as the “colimit” of the “right chain”


Data Type Category Theory Total Function Initial Object Finite Product 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes and References for Chapter 11

  1. 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

Copyright information

© Springer-Verlag New York Inc. 1986

Authors and Affiliations

  • Ernest G. Manes
    • 1
  • Michael A. Arbib
    • 2
  1. 1.Department of Mathematics and StatisticsUniversity of MassachusettsAmherstUSA
  2. 2.Departments of Computer Science, Neurobiology and PhysiologyUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations