On program transformation with tupling technique

  • Akihiko Koga
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 220)


In this paper, we construct a theory for an automatic program transformation with tupling technique. We introduce a purely applicative programming language and formalize a problem to find a tuple for transformation of a recursive program written in the language. We discuss the transformation scheme with the tuple given as the solution to the problem and show that the execution efficiency will be improved by the new scheme. Under a certain constraint, we describe the method to find a tuple for a given program.


Auxiliary Function Function Symbol Recursive Call Program Transformation Recursive Program 
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. 1.
    Burstall, R.M., Darlington, J.: A Transformation System for Developing Recursive Programs. JACM 24, 1, pp44–67 (1977)CrossRefGoogle Scholar
  2. 2.
    Cohen, N.H.: Eliminating Redundant Recursive Calls. ACM Trans. Prog. Lang. Syst. 4. 1, pp256–299 (1983)Google Scholar
  3. 3.
    Feather, M.S.: A System for Assisting Program Transformation. ACM Trans. Lang. Syst. 4. 1, pp1–20 (1982)CrossRefGoogle Scholar
  4. 4.
    Friedman, D.P., Wise, D,S,: Functional Combination. Computer Languages. Vol. 3. pp31–35 (1978)CrossRefGoogle Scholar
  5. 5.
    Koga,A.: On Program Transformation with Tupling Technique. Master's thesis, Research Institute for Mathematical Sciences, Kyoto University,(Feb, 1983)Google Scholar
  6. 6.
    Pettorossi, A.: Improving Memory Utilization in Transforming Programs. Lecture Notes in Computer Science No. 64, pp416–425. Berlin-Heidelberg New York: Springer (1978)Google Scholar
  7. 7.
    Pettorossi, A.: Transformation of Programs and Use of "Tupling Strategy". Proc. of Informatica '77 Conference, Bled, Yugoslavia, 3–103, pp1–6 (1977)Google Scholar
  8. 8.
    Pettorossi, A., Burstall, R.M.: Deriving Very Efficient Algorithm for Evaluation Linear Recurrence Relations Using the Program Transformation Technique. Acta Informatica 18, pp181–206 (1982)CrossRefGoogle Scholar
  9. 9.
    Wand, M.: Continuation-based Program Transformation Strategies. JACM 27, 1, pp164–180Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Akihiko Koga
    • 1
  1. 1.Systems Development LaboratoryHitachi, Ltd.Japan

Personalised recommendations