Skip to main content
SpringerLink
Log in

On program transformation with tupling technique

  • Conference paper
  • First Online:
RIMS Symposia on Software Science and Engineering II

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 220))

  • 143 Accesses

Abstract

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.

This paper is the revised version of the author's master's thesis [5].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burstall, R.M., Darlington, J.: A Transformation System for Developing Recursive Programs. JACM 24, 1, pp44–67 (1977)

    Article  Google Scholar 

  2. Cohen, N.H.: Eliminating Redundant Recursive Calls. ACM Trans. Prog. Lang. Syst. 4. 1, pp256–299 (1983)

    Google Scholar 

  3. Feather, M.S.: A System for Assisting Program Transformation. ACM Trans. Lang. Syst. 4. 1, pp1–20 (1982)

    Article  Google Scholar 

  4. Friedman, D.P., Wise, D,S,: Functional Combination. Computer Languages. Vol. 3. pp31–35 (1978)

    Article  Google Scholar 

  5. Koga,A.: On Program Transformation with Tupling Technique. Master's thesis, Research Institute for Mathematical Sciences, Kyoto University,(Feb, 1983)

    Google Scholar 

  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. 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. 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)

    Article  Google Scholar 

  9. Wand, M.: Continuation-based Program Transformation Strategies. JACM 27, 1, pp164–180

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Development Laboratory, Hitachi, Ltd., Japan

    Akihiko Koga

Authors
  1. Akihiko Koga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eichi Goto Keijiro Araki Taiichi Yuasa

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koga, A. (1986). On program transformation with tupling technique. In: Goto, E., Araki, K., Yuasa, T. (eds) RIMS Symposia on Software Science and Engineering II. Lecture Notes in Computer Science, vol 220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16470-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-16470-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16470-8

  • Online ISBN: 978-3-540-39809-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation