Program transformation by supercompilation

  • Valentin F. Turchin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)


Free Variable Initial Configuration Partial Evaluation Active Term Basic Configuration 
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. [Beckman et al. 1974]
    L. Beckman,A. Haraldson,O. Oskarson, O. Sandewall. 1974 A partial evaluator and its use as a programming tool. Artificial Intelligence 7, 319–357.Google Scholar
  2. [Ershov 1977]
    A.P.Ershov. On the essence of translation, in Neuhold E.J., ed. Formal Description of Programming Concepts, North-Holland, 391–418.Google Scholar
  3. [Ershov 1982]
    A.P. Ershov. 1982 Mixed computation: potentilal applications and problems for future studies. Theoretical Computer Science, 18, North-Holland, 41–67.Google Scholar
  4. [Futamura 1971]
    Y. Futamura. 1971 Partial evaluation of computation process — an approach to compiler-compiler. Systems, Computers, Control, 2(5), 45–50.Google Scholar
  5. [Futamura 1983]
    Y. Futamura. 1983 Partial computation of programs, Proc RIMS Symp. Software Science and Engineering, Springer-Verlag, LNCS 147, 1–35.Google Scholar
  6. [FriWis 1967]
    D.P.Fridman and D.S.Wise, CONS should not evaluate its arguments, in Automata, Languages and Programming, Michaelson and Millner ed-s, Edinburgh Univ. Press, 257–284.Google Scholar
  7. [HenMor 1976]
    P.Henderson and J.H.Morris Jr. A lazy evaluator. Proc. 3rd Symp. on POPL, 95–103.Google Scholar
  8. [JonSch 1980]
    N. Jones and D. Schmidt. 1980 Compiler generation from denotational semantics, in Jones N. ed.,Semantics-Driven Compiler Generation, Springer-Verlag, LNCS 94, 70–93.Google Scholar
  9. [Jones et al. 1985]
    N.D.Jones,P.Sestoft, H.Søndergaard. An experiment in partial evaluation: the generation of a compiler generator, International Conference on Rewriting Techniques and Applications, 1985 Springer-Verlag (to be published).Google Scholar
  10. [JonTof 1983]
    N.Jones and M.Tofte, Some principles and notation for the construction of compiler generators, DIKU, Univ. of Copenhagen, Internal report.Google Scholar
  11. [Lombardi 1967]
    L.A.Lombardi. Incremental computation, Advances in Computers, 8 Academic Press.Google Scholar
  12. [REFAL 1977]
    Basic Refal and its Implementation on Computers (in Russian), GOSSTROI SSSR, TsNIPIASS, Moscow 1977 (The authors are not indicated in the book. In fact they are: V.F.Khoroshevski, And.V.Klimov, Ark.V.Klimov, A.G.Krasovski, S.A.Romanenko, I.B.Shchenkov, V.F.Turchin.)Google Scholar
  13. [Turchin 1972]
    V.F.Turchin, Equivalent transformation of recursive functions defined in Refal (in Russian), in Trudy Vsesoyuzn. Simpos. "Teoria Yazykov i metody progr". Alushta-Kiev. pp. 31–42Google Scholar
  14. [Turchin 1979]
    V.F. Turchin. 1979 A supercompiler system based on the language Refal, SIGPLAN Notices, 14, 46–54.Google Scholar
  15. [Turchin 1980a]
    V.F.Turchin. The Language Refal, the Theory of Compilation, and Metasystem Analysis, Courant Institute Report #20, New York.Google Scholar
  16. [Turchin 1980b]
    Semantics definitions in Refal and automatic production of compilers, in Jones N. ed.,Semantics-Driven Compiler Generation, Springer-Verlag, LNCS 94, 443–474.Google Scholar
  17. [TurNirTur 1982]
    V.F.Turchin, R.N.Nirenberg, D.V.Turchin. Experiments with a supercompiler, in ACM Symposium on LISP and Functional Programming, 47–55.Google Scholar
  18. [Vuillemin 1974]
    J.Vuillemin. Correct and optimal implementation of resursion in a simple programming language. J. of Computer and System Studies 9, #3, Dec. 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Valentin F. Turchin
    • 1
  1. 1.The City College of New YorkNew York

Personalised recommendations