Abstract
The previous chapter considered a number of situations in which an object of semantic interest arises as the least fixed point of a continuous map ψ:(D, ≤)→(D, ≤) of some domain (D, ≤). So far, the domain structure is but a technical device to distinguish the least fixpoint from the other fixed points.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Notes and References for Chapter 7
“The pattern-of-calls expansion is the canonical fixed point for recursive definitions,” journal of the Association for Computing Machinery,29, 1982, pp. 557–602.
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). Canonical Fixed Points. 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_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_7
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