Abstract
The task of the next three chapters is to better understand the abstract principles underlying the ideas associated with recursive definitions of partial functions as presented in Chapter 5 and to thereby elevate the theory to a wide class of semantic categories.
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 6
D. S. Scott [“Lattice theory, data types and semantics,” in R. Rustin (ed.), Formal Semantics of Programming Languages, Prentice-Hall, 1970].
S. C. Kleene [Introduction to Mathematics, Van Nostrand, 1952].
A. Tarski [“A lattice-theoretical fixpoint theorem and its applications,” Pacific Journal of Mathematics, 5, 1955, pp. 285–309].
D. N. Arden [“Delayed logic and finite-state machines,” in Theory of Computing Machine Design, University of Michigan Press, Ann Arbor, 1960, pp. 1–35].
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). Order Semantics of Recursion. 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_6
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