Advertisement

A treatment of languages with stages of evaluation

  • Laurette Bradley
Part V Implementation Issues
Part of the Lecture Notes in Computer Science book series (LNCS, volume 298)

Abstract

The notion of languages that inherently have multiple stages of evaluation is introduced. Typically, evaluation is done in stages so that evaluation in some one stage is able to be done very efficiently, even at the expense of prior stages of evaluation. A key novel feature in such languages is that constructs may have appropriate times of meaning as well as appropriate meanings. While it is possible to give semantics to such languages without regard to times of meaning, it is shown that certain semantic related concepts, such as translation, cannot be adequately described without reference to times of evaluation. The major contribution provided here to the study of complex languages with multiple stages of evaluation is the development of a method of describing such languages so that semantics reflecting various times of evaluation can be derived from the descriptions.

Keywords

Programming Language Language Design Language Expression Denotational Semantic Semantic Domain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [ADJ 77]
    Thatcher, J.W., Wagner, E.G., Wright, J.B., "Initial algebra semantics and continuous algebras", JACM Vol 24, No 1, January 1977, p 68–95.CrossRefGoogle Scholar
  2. [ADJ 80]
    Thatcher, J.W., Wagner, E.G., Wright, J.B., "More Advice on Structuring Compilers and Proving Them Correct", In: Semantics Directed Compiler Generation,N. Jones editor, Springer-Verlag, 1980, p. 165–189.Google Scholar
  3. [Bradley 85]
    Bradley, Laurette, A Study of Language Representation of Semantic Domains with Applications to Language Design and Definition, Dissertation, University of Michigan, 1985.Google Scholar
  4. [Bradley 87]
    Bradley, Laurette, "Timely Semantics: Definitions for Languages in Complex Settings", in preparation.Google Scholar
  5. [Carnap 47]
    Carnap, Rudolf. Meaning and Necessity. University of Chicago, 1947.Google Scholar
  6. [Frege 92]
    Frege, Gottlob. Ueber Sinn und Bedeutung in Zeitshr. fur Philos. und philos Kritik. 100 (new ser. 1892) 25–50. English translation in Translations from the Philosophical Writings, translated by P. Geach and M. Black, Oxford, 1952.Google Scholar
  7. [Jorring 86]
    Jorring, Ulrik and Scherlis, William. "Compilers and Staging Transformations" Thirteenth Symposium on Principles of Programming Languages, pp 86–96, 1986.Google Scholar
  8. [Lee 87]
    Lee, Peter and Pleban, Uwe. "A Realistic Compiler Generator Based on High-Level Semantics", Fourteenth Symposium on Principles of Programming Languages, pp 284–295, 1987.Google Scholar
  9. [LLS 68]
    Lucas, P., Lauer, P, Stigleitner, H., "Method and Notation for the Formal Definition of Programming Languages", Technical Report 25.087, IBM Laboratories, Vienna Austria.Google Scholar
  10. [Montague 74]
    Montague, Richard. Formal Philosophy, Yale University, 1974.Google Scholar
  11. [Morris 73]
    Morris, F.L., "Advice on Structuring Compilers and Proving Them Correct", Proceedings ACM Symposium on Principles of Programming Languages, 1973, p. 144–152.Google Scholar
  12. [Mosses 79]
    Mosses, P., "SIS-reference manual and user's guide", DAIMI MD-30, Aarhus University, Aarhus, Denmark.Google Scholar
  13. [Nielson 86]
    Nielson, H. R. and Nielson F. "Semantics directed compiling for functional languages", Proc. 1986 ACM Conf. LISP and Functional Programming, p. 249–257. DAIMI MD-30, Aarhus University, Aarhus, Denmark.Google Scholar
  14. [Paulson 82]
    Paulson, L., A semantics-directed compiler generator, Ninth Symposium on Principles of Programming Languages, pp 224–233, 1982.Google Scholar
  15. [Schoenfield 67]
    Schoenfield, Joseph R. Mathematical Logic, Addison-Wesley, 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Laurette Bradley
    • 1
  1. 1.Dept. of Computer Science and Engineering, C-014University of California, San DiegoLa Jolla

Personalised recommendations