The structure of a self-applicable partial evaluator

  • Peter Sestoft
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)


Residual Program Partial Evaluation Abstract Interpretation Residual Function Goal Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (Bulyonkov 84).
    Bulyonkov, M. A. Polyvariant mixed computation for analyzer programs. Acta Informatica 21, (1984), pp. 473–484.Google Scholar
  2. (Dybkjær 85).
    Dybkjær, Hans. Parsers and partial evaluation: An experiment. DIKU Student Report 85-7-15 (July 1985). 128 pp.Google Scholar
  3. (Emanuelson, Haraldsson 80).
    Emanuelson, Pär & Anders Haraldsson. On compiling embedded languages in LISP. In Conf. Rec. of the 1980 LISP Conference, Stanford, California, pp. 208–215.Google Scholar
  4. (Ershov 78).
    Ershov, Andrei P. On the essence of compilation. In Neuhold, E. J. (ed.): Formal Description of Programming Concepts, North-Holland, 1978, pp. 391–420.Google Scholar
  5. (Ershov 82).
    Ershov, Andrei P. Mixed computation: Potential applications and problems for study. Theoretical Computer Science 18 (1982), pp. 41–67.Google Scholar
  6. (Futamura 71).
    Futamura, Yoshihiko. Partial evaluation of computation process — an approach to a compiler-compiler. Systems, Computers, Controls 2, no. 5 (1971), pp. 45–50.Google Scholar
  7. (Futamura 83).
    Futamura, Yoshihiko. Partial computation of programs. Proc. RIMS Symp. Software Science and Engineering, Kyoto, Japan, 1982. Springer LNCS 147 (1983), pp. 1–35.Google Scholar
  8. (Haraldsson 78).
    Haraldsson, Anders. A partial evaluator and its use for compiling iterative statements in LISP. In Conf. Rec. of the 5th ACM POPL, Tucson, Arizona, 1978, pp. 195–203.Google Scholar
  9. (Jones, Mycroft 86).
    Jones, Neil D. & Alan Mycroft. Data flow analysis using minimal function graphs. In Conf. Rec. of the 13th ACM POPL, St. Petersburg, Florida, 1986. (To appear).Google Scholar
  10. (Jones, Sestoft, Søndergaard 85).
    Jones, Neil D., Peter Sestoft & Harald Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In Proc. 1st Intl. Conf. on Rewriting Techniques and Applications, Dijon, France, 1985. Springer LNCS 202 (1985), pp. 124–140. (A preliminary version appeared as DIKU Report 85/1, January 1985).Google Scholar
  11. (Jones, Tofte 83).
    Jones, Neil D. & Mads Tofte. Some principles and notations for the construction of compiler generators. Unpublished working paper, DIKU, July 29, 1983. 15 pp.Google Scholar
  12. (Kahn, Carlsson 84).
    Kahn, Kenneth M. & Mats Carlsson. The compilation of Prolog programs without the use of a Prolog compiler. In Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, 1984, ICOT, 1984, pp. 348–355.Google Scholar
  13. (Kleene 52).
    Kleene, S. C. Introduction to Metamathematics. Van Nostrand, 1952.Google Scholar
  14. (Sestoft 85).
    [Sestoft, Peter]. The Mix system: User manual and short description. DIKU, April 26th, 1985. 14 pp.Google Scholar
  15. (Turchin 79).
    Turchin, Valentin F. A supercompiler system based on the language REFAL. SIGPLAN Notices 14, no. 2 (February 1979), pp. 46–54.Google Scholar
  16. (Turchin 80).
    Turchin, Valentin F. Semantic definitions in REFAL and the automatic construction of compilers. In Jones, Neil D. (ed.): Semantics Directed Compiler Generation. Springer LNCS 94, (1980), pp. 441–474.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Peter Sestoft
    • 1
  1. 1.DIKU University of CopenhagenCopenhagen ØDenmark

Personalised recommendations