Abstract
Chapters I and II of this paper provide an elementary introduction to the mathematical theory underlying the denotational semantic definition techniques described in this volume; the next two chapters discuss some techniques of use in reasoning about such definitions, and Chapter V describes one way of handling the semantics of languages involving jumps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burstall, R.M.: Proving Properties of Programs by Structural Induction; Comp. J. 12, 41 (1969).
Hoare, C.A.R.: An Axiomatic Basis for Computer Programming; CACM 12, 576 (1969).
Jones, C.B.: Denotational Semantics of goto: an Exit Formulation and its Relation to Continuations; p. 278 of: Bjørner, D., and Jones, C.B. (eds.): The Vienna Development Method: The Meta-Language; (Springer-Verlag, 1978).
Milne, R.E., and Strachey, C.: A Theory of Programming Language Semantics; (Chapman and Hall, London, and Wiley, New York, 1976).
Plotkin, G.D.: A Power Domain Construction; SIAM J. Comp. 5, 452 (1976).
Sanderson, J.G.: The Lambda Calculus, Lattice Theory and Reflexive Domains; Mathematical Institute Lecture Notes, University of Oxford (1973).
Scott, D.S.: Outline of a Mathematical Theory of Computation; Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, 169 (Princeton University, 1970); and Technical Monograph PRG-2, Programming Research Group, University of Oxford (1970).
Scott, D.S.: Models for Various Type-free Calculi; p. 157 of: Suppes, P., Henkin, L., Joja, A., and Moisil, G.C. (eds.): Logic, Methodology and Philosophy of Science IV; (North-Holland, 1973).
Scott, D.S.: Data Types as Lattices; SIAM J. Comp. 5, 522 (1976).
Scott, D.S., and Strachey, C.: Toward a Mathematical Semantics for Computer Languages; p. 19 of: Fox, J. (ed.): Proceedings of the Symposium on Computers and Automata; (Polytechnic Institute of Brooklyn Press, 1971); and Technical Monograph PRG-6, Programming Research Group, University of Oxford (1971).
Smyth, M.B.: Powerdomains; Theory of Computation Report 12, Department of Computer Science, University of Warwick (1976).
Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory; (MIT Press, 1977).
Strachey, C., and Wadsworth, C.P.: Continuations: A Mathematical Semantics for Handling Full Jumps; Technical Monograph PRG-11 (Oxford University Computing Laboratory, Programming Research Group, 1974).
Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications; Pacific J. of Maths 5, 285 (1955).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stoy, J.E. (1980). Foundations of denotational semantics. In: Bjøorner, D. (eds) Abstract Software Specifications. Lecture Notes in Computer Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10007-5_35
Download citation
DOI: https://doi.org/10.1007/3-540-10007-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10007-2
Online ISBN: 978-3-540-38136-5
eBook Packages: Springer Book Archive