Part of the Texts and Monographs in Computer Science book series (MCS)
In Section 2 we will define “lists of E” in terms of the least fixed point specification
(i.e., “a list is the empty list (1 = }Λ}) or an element of E followed by a list). But the parenthetical explication just given works only in Set, whereas the specification works in any category in which polynomial functors have least fixed points. In this sense E is a “parameter” for the “lists-of-” specifier. The specific parameter E may itself arise from another data type specification and may live in a category of arbitrary complexity subject to the technical needs of semantics.
$$E*:: = 1 + E \times E*$$
KeywordsParametric Specification Empty Word Fixed Point Property Terminal Object Program Semantic
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.
© Springer-Verlag New York 1986