A semantic algebra for binding constructs
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.
KeywordsProgramming languages semantics abstract data types formalization of programming concepts algebras binding constructs
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- Burstall, R.M. & Goguen, J.A. (1977) "Putting theories together to make specifications", in Proc. Fifth Int. Joint Conf. on Artificial Intelligence, 1977.Google Scholar
- Gordon, M.J.C. (1979) The Denotational Description of Programming Languages, Springer, 1979.Google Scholar
- 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.Google Scholar