Abstract
This paper presents a semantic algebra, suitable for use in giving the denotational semantics of various forms of declarations and binding constructs in programming languages. The emphasis of the paper is on the development of semantic descriptions which are easy to understand at an intuitive level, being based on algebraic operators corresponding to fundamental concepts of programming languages. Some familiarity with denotational semantics and abstract data types is assumed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ADJ: Thatcher, J.W., Wagner, E.A. & Wright, J.B. (1979) "More on advice on structuring compilers and proving them correct", in Proc. Sixth Int. Coll. on Automata, Languages and Programming (ed. Maurer, H.A.). Lect. Notes in Comp. Sci. 71, Springer, 1979.
Burstall, R.M. & Goguen, J.A. (1977) "Putting theories together to make specifications", in Proc. Fifth Int. Joint Conf. on Artificial Intelligence, 1977.
Gordon, M.J.C. (1979) The Denotational Description of Programming Languages, Springer, 1979.
Mosses, P. (1980) "A constructive approach to compiler correctness", in Proc. Seventh Int. Coll. on Automata, Languages and Programming (eds. de Bakker, J.W. & van Leeuwen, J.). Lect. Notes in Comp. Sci. 85, Springer, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mosses, P. (1981). A semantic algebra for binding constructs. In: DÃaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_115
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_115
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive