Abstract
Work initiated by D. S. Scott and C. Strachey in the 1960s, and contributed to by many up to the present writing, yields a framework for program semantics in which every data type is a domain and every computed function is continuous. We provide a critique of these basic assumptions in Section 1, but then proceed to develop an introduction to this theory of ordered semantics in the remaining sections.
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 13
D. S. Scott and C. Strachey, “Towards a mathematical semantics for computer languages,” in Proceedings of the Symposium on Computers and Automata (J.’ Fox, ed.), Polytechnic Institute of Brooklyn Press, 1971, pp. 19–46.
D. S. Scott, “Models for various type-free calculi,” Proceedings of the IVth International Congress for Logic, Methodology and Philosophy of Science IV (P. Suppes, L. Henkin, A. Joja, and G. C. Moisil, eds.), North-Holland 1973, pp. 157–187.
D. S. Scott, “Data types as lattices,” SIAM Journal of Computing, 5, 1976, pp. 522–587.
J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977.
M. J. C. Gordon, The Denotational Description of Programming Languages, An Introduction, Springer-Verlag, 1979.
A. J. Kfoury, R. N. Moll, and M. A. Arbib, A Programming Approach to Computability, Springer-Verlag, 1982.
G. D. Plotkin, “A power domain construction,” SIAM Journal of Computing, 5, 1976, pp. 452–487.
M. A. Arbib and E. G. Manes, “Port automata and the algebra of concurrent processes,” Journal of Computer and System Sciences, 27, 1983, pp. 29–50.
R. Milner, A Calculus of Communicating Systems, Springer-Verlag, 1980.
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 Data Types. 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_13
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_13
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