From standard to implementation denotational semantics

  • Martin Raskovsky
  • Phil Collier
Compilers Based On Denotational Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 94)


We are developing a compiler compiler. It takes as input the formal definition of a programming language in Denotational Semantics and produces as output a fairly efficient compiler written in a systems programming language which in turn will produce code for a real machine. This work mainly deals with the code generation parts.


Boolean Expression Environment Domain Denotational Semantic Function Closure Simple Case Study 


  1. [BCPL77]
    Reference manual. Department Of Computer Science. Essex University. 1977.Google Scholar
  2. [Bornat76]
    R.Bornat. Notes for Comparative Study of Programming Languages, Department Of Computer Science. Essex University. 1976.Google Scholar
  3. [Bornat77]
    R.Bornat. Understanding and Writing Compilers. MacMillan 1977.Google Scholar
  4. [Gries71]
    D.G.Gries. Compiler Construction for Digal Computers. J.Wiley and Sons. 1971.Google Scholar
  5. [Hayes78]
    P.J.Hayes. Invocation Records: A conceptual Framework for Evaluating Program Text. Department Of Computer Science. Essex University. 1979.Google Scholar
  6. [Jones80]
    N.D. Jones and D.A.Schmidt. Compiler Generation from Denotational Semantics (Preliminary Report) Workshop on Semantics-Directed Compiler Generation. Department Of Computer Science. Aarnus University. 1980.Google Scholar
  7. [Milne76]
    R.Milne and C.Strachey. A Theory of programming language semantics, Chapman and Hall. 1976.Google Scholar
  8. [Mosses74]
    P.D.Mosses. The Semantics of Semantic Equations, Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 28. Springer-Verlag. Proc. 3rd MFCS Symposium. Warsaw. 1974. pp. 409–422Google Scholar
  9. [Mosses75]
    P.D.Mosses. Mathematical Semantics and Compiler Generation, PhD. thesis. University of Oxford. 1975.Google Scholar
  10. [Mosses76]
    P.D.Mosses. Compiler Generation using Denotational Semantics, Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 45. Springer-Verlag. Proc. 5th MFCS Symposium. Gdansk Poland. 1976. pp.436–441Google Scholar
  11. [Mosses78]
    P.D.Mosses. SIS: A Compiler Generator System using Denotational Semantics, Reference Manual. University of Aarhus. 1978.Google Scholar
  12. [Raskovsky79]
    M.R.Raskovsky and R.Turner. Compiler Generation and Denotational Semantics. Fundamentals of Computation Theory, 1979.Google Scholar
  13. [Raskovsky80]
    M.R.Raskovsky. ISL (In preparation) Department Of Computer Science. Essex University. 1980.Google Scholar
  14. [Richards69]
    M.Richards. BCPL: A tool for compiler writing and system programming. Proceedings of the 1969 Spring Joint Computer Conference. Boston AFIPS Montvale 1969 pp. 557–566.Google Scholar
  15. [Scott70]
    D.Scott. Outline of a Mathematical Theory of Computation, PRG-2. Oxford University Computing Laboratory. 1970.Google Scholar
  16. [Scott71]
    D.Scott and C.Strachey. Toward a Mathematical Semantics for Computer Languages, PRG-6. Oxford University Computing Laboratory. 1971.Google Scholar
  17. [Scott76]
    D. Scott. Data Types as Lattices, Procedings of the 1974 Colloquium in Mathematical Logic. Kiel. Springer-Verlag. Berlin 1976. pp.579–650.Google Scholar
  18. [Stoy77]
    J.E.Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press. 1977.Google Scholar
  19. [Stoy77]
    J.E.Stoy. The congruence of Two Programming Language Definitions. (manuscript). 1979.Google Scholar
  20. [Strachey66]
    C. Strachey. Towards a formal semantics, Formal Language Description Languages for Computer Programming. (edited by T.B. Steel). North-Holland. Amsterdam 1966. pp.198–220.Google Scholar
  21. [Strachey67]
    C.Strachey. Fundamental Concepts in Programming Languages, International Summer School in Computer Programming, 1967 (Typescript).Google Scholar
  22. [Strachey74]
    C.Strachey and C.P.Wadsworth. Continuations, A Mathematical Semantics for handling full jumps, PRG-11. Oxford University Computing Laboratory. 1974.Google Scholar
  23. [Sufrin77]
    B.Sufrin. LLI: A Parser Generator. Department Of Computer Science. Essex University. 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Martin Raskovsky
    • 1
  • Phil Collier
    • 1
  1. 1.Computing ScienceUniversity of EssexEngland

Personalised recommendations