Advertisement

Semantics-directed generation of a Prolog compiler

  • Charles Consel
  • Siau Cheng Khoo
Session: Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 528)

Keywords

Residual Program Partial Evaluation Denotational Semantic Interpretation Function Dynamic Semantic 
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.

References

  1. [1]
    D. Bjørner, A. P. Ershov, and N. D. Jones, editors. Partial Evaluation and Mixed Computation. North-Holland, 1988.Google Scholar
  2. [2]
    A. Bondorf and O. Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. DIKU Research Report 90/04, University of Copenhagen, Copenhagen, Denmark, 1990. To appear in Science of Computer Programming.Google Scholar
  3. [3]
    W. F. Clocksin and C. S. Mellish. Programming in Prolog. Springer-Verlag, 1981.Google Scholar
  4. [4]
    C. Consel. New insights into partial evaluation: the Schism experiment. In H. Ganzinger, editor, ESOP'88, 2 nd European Symposium on Programming, volume 300 of Lecture Notes in Computer Science, pages 236–246. Springer-Verlag, 1988.Google Scholar
  5. [5]
    C. Consel. Analyse de Programmes, Evaluation Partielle et Génération de Compilateurs. PhD thesis, Université de Paris VI, Paris, France, June 1989.Google Scholar
  6. [6]
    C. Consel. Binding time analysis for higher order untyped functional languages. In ACM Conference on Lisp and Functional Programming, pages 264–272, 1990.Google Scholar
  7. [7]
    C. Consel. The Schism Manual. Yale University, New Haven, Connecticut, USA, 1990. Version 1.0.Google Scholar
  8. [8]
    C. Consel and O. Danvy. For a better support of static data flow. In FPCA'91, 5 th International Conference on Functional Programming Languages and Computer Architecture, 1991. To appear.Google Scholar
  9. [9]
    C. Consel and O. Danvy. Static and dynamic semantics processing. In ACM Symposium on Principles of Programming Languages, pages 14–23, 1991.Google Scholar
  10. [10]
    C. Consel and S.C. Khoo. Semantics-directed generation of a Prolog compiler. Research Report 781, Yale University, New Haven, Connecticut, USA, 1990. Extended version.Google Scholar
  11. [11]
    S.K. Debray and P. Mishra. Denotational and operational semantic for prolog. Journal of Logic Programming, 5:61–91, 1988.Google Scholar
  12. [12]
    M. Felleisen. Transliterating Prolog into Scheme. Technical Report 182, Indiana University, Bloomington, Indiana, 1985.Google Scholar
  13. [13]
    H. Fujita and K. Furukawa. A self-applicable partial evaluator and its use in incremental compiler. In Y. Futamura, editor, New Generation Computing, volume 6 of 2,3. OHMSHA. LTD. and Springer-Verlag, 1988.Google Scholar
  14. [14]
    D. A. Fuller and S. Abramsky. Mixed computation of Prolog. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation. North-Holland, 1988.Google Scholar
  15. [15]
    N. D. Jones and A. Mycroft. Stepwise development of operational and denotational semantics for Prolog. In IEEE International Symposium on Logic Programming, pages 289–298, 1984.Google Scholar
  16. [16]
    N. D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: the generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, Dijon, France, volume 202 of Lecture Notes in Computer Science, pages 124–140. Springer-Verlag, 1985.Google Scholar
  17. [17]
    N. D. Jones, P. Sestoft, and H. Søndergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9–50, 1989.Google Scholar
  18. [18]
    K. M. Kahn and M. Carlsson. The compilation of Prolog programs without the use of Prolog compiler. In International Conference on Fifth Generation Computer Systems, pages 348–355, 1984.Google Scholar
  19. [19]
    H. J. Komorowski. A specification of an abstract Prolog machine and its application to partial evaluation. Linkoping studies in science and technology dissertations no 69, Linkoping University, Linkoping, Sweden, 1981.Google Scholar
  20. [20]
    H. J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog. In ACM Symposium on Principles of Programming Languages, 1982.Google Scholar
  21. [21]
    P. Lee and U. F. Pleban. On the use of Lisp in implementing denotational semantics. In ACM Conference on Lisp and Functional Programming, pages 233–248, 1986.Google Scholar
  22. [22]
    T. Nicholson and N. Foo. A denotational semantics for Prolog. ACM Transactions on Programming Languages and Systems, 11(4), 1989.Google Scholar
  23. [23]
    J. Rees and W. Clinger. Revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(12):37–79, 1986.Google Scholar
  24. [24]
    D. A. Schmidt. Denotational Semantics: a Methodology for Language Development. Allyn and Bacon, Inc., 1986.Google Scholar
  25. [25]
    P. Sestoft. Automatic call unfolding in a partial evaluator. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation. North-Holland, 1988.Google Scholar
  26. [26]
    R. Venken. A Prolog meta-interpreter for partial evaluation and its application to source to source transformation and query-optimisation. In T. O'Shea, editor, ECAI'84. North-Holland, 1988.Google Scholar
  27. [27]
    M. Wand. A semantic prototyping system. SIGPLAN Notices, ACM Symposium on Compiler Construction, 19(6):213–221, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Charles Consel
    • 1
  • Siau Cheng Khoo
    • 1
  1. 1.Yale UniversityUSA

Personalised recommendations