Skip to main content
SpringerLink
Log in

Program transformation system based on generalized partial computation

  • Special Feature
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Generalized Partial Computation (GPC) is a program transformation method utilizing partial information about input data, abstract data types of auxiliary functions and the logical structure of a source program. GPC uses both an inference engine such as a theorem prover and a classical partial evaluator to optimize programs. Therefore, GPC is more powerful than classical partial evaluators but harder to implement and control. We have implemented an experimental GPC system called WSDFU (Waseda Simplify-Distribute-Fold-Unfold). This paper demonstrates the power of the program transformation system as well as its theorem prover and discusses some future works.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amtoft, T., Consel, C., Danvy, O. and Malmkjaer, K., “The Abstraction and Instantiation of String-matching Programs,” Personal Communication, May, 2001.

  2. Bird, R. S., “Improving Programs by the Introduction of Recursion,”Comm. ACM 20, 11, pp. 856–863, 1977.

    Article  MathSciNet  Google Scholar 

  3. Boyer, R. S. and Moore, J. S., “A Fast String Searching Algorithm,”Comm. ACM 20, 10, pp. 761–772, 1977.

    Article  Google Scholar 

  4. Burstall, R. M. and Darlington, J. A., “Transformation System for Developing Recursive Programs,”JACM, 24, 1, pp. 44–67, 1977.

    Article  MathSciNet  Google Scholar 

  5. Chang, C. and Lee, R. C.,Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

    Chapter  Google Scholar 

  6. Cormen, T. H., Leiserson, C. E. and Rivest, R. L.,Introduction to Algorithms, The MIT Press, 1990.

  7. “Partial Evaluation,” inProc. of Lecture Notes in Computer Science 1110, (Danvy, O., Glück, R. and Thiemann, P., eds.) Springer-Verlag, 1996.

  8. Futamura, Y. and Nogi, K., “Generalized Partial Computation,” inPartial Evaluation and Mixed Computation (Bjørner, D., Ershov, A. P. and Jones, N. D. eds.), North-Holland, Amsterdam, pp. 133–151, 1988.

    Google Scholar 

  9. Futamura, Y., Nogi, K. and Takano, A., “Essence of Generalized Partial Computation,”Theoretical Computer Science, 90, pp. 61–79, 1991.

    Article  Google Scholar 

  10. Futamura, Y. and Nogi, K.,Program Transformation Based on Generalized Partial Computation, 5241678, US-Patent, Aug. 31, 1993.

  11. Futamura, Y. and Otani, H., “Recursion Removal Rules for Linear Recursive Programs and Their Effectiveness,”Computer Software, JSSST 15, 3, pp. 38–49, 1998. (in Japanese)

    Google Scholar 

  12. Futamura, Y., “Partial Evaluation of Computation Process — An approach to a Compiler-Compiler,”Higher-Order and Symbolic Computation, 12, 4, pp. 381–391, 1999.

    Article  Google Scholar 

  13. Futamura, Y., “Partial Evaluation of Computation Process Revisited,”Higher-Order and Symbolic Computation, 12, 4, pp. 377–380, 1999.

    Article  Google Scholar 

  14. Futamura, Y., Konishi, Z. and Glück, R., “Implementation of an Experimental System for Automatic Program Transformation Based on Generalized Partial Computation,”The 3rd International Workshop on Intelligent Software Engineering, Limerick, Ireland, June 2000.

  15. Glück, R. and Klimov, A. V., “Occam’s Razor in Metacomputation: the Notion of a Perfect Process Tree,” inStatic Analysis, Lecture Notes in Computer Science 724 (Cousot, P., et al. eds.), Springer-Verlag, pp. 112–123, 1993.

    Chapter  Google Scholar 

  16. Graham, R. L., Knuth, D. E. and Patashnik, O.,Concrete Mathematics, Addison-Wesley, 1989.

  17. Hearn, A. C., “REDUCE — A Case Study in Algebra System Development,”Lecture Notes in Computer Science, 144, Springer-Verlag, Berlin, 1982.

    Google Scholar 

  18. Jones, N. D., “An Introduction to Partial Evaluation,”ACM Computing Surveys, 28, 3, pp. 480–503, 1996.

    Article  Google Scholar 

  19. Konishi, Z. and Futamura, Y., “A Theorem Proving System and a Terminating Process for Generalized Partial Computation (GPC),”RIMS Workshop on Program Transformation, Symbolic Computation and Algebraic Manipulation, pp. 59–64, 1999. (in Japanese)

  20. Konishi, Z. and Futamura, Y., “Recursion Removal on Generalized Partial Computation (GPC),” inProc. of the 17th National Conference, C5-2, JSSST, 2000. (in Japanese)

  21. Matsuya, M. and Futamura, Y., “Program Transformation and Algebraic Manipulation,”RIMS Workshop on Program Transformation, Symbolic Computation and Algebraic Manipulation, pp. 115–122, 1999. (in Japanese)

  22. Pettorossi, A. and Proietti, M., “Rules and Strategies for Transforming Functional and Logic Programs,”ACM Computing Surveys, 28, 2, pp. 360–414, 1996.

    Article  Google Scholar 

  23. Sørensen, M. H., Glück, R. and Jones, N. D., “A Positive Supercompiler,”Journal of Functional Programming, 6, 6, pp. 811–838, 1996.

    Article  Google Scholar 

  24. Takano, A., Nogi, K. and Futamura, Y., “Termination Conditions of Generalized Partial Computation,” inProc. of the 7th National Conference, C8-1, JSSST, 1990. (in Japanese)

  25. Turchin, V. F., “The Concept of a Supercompiler,” ACM TOPLAS, 8, 3, pp. 292–325, 1986.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Waseda University, 3-4-1 Okubo, Shinjuku, 169-8555, Tokyo, Japan

    Yoshihiko Futamura, Zenjiro Konishi & Robert Glück

  2. PRESTO, JST, Japan

    Robert Glück

Authors
  1. Yoshihiko Futamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zenjiro Konishi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Glück
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Yoshihiko Futamura, Ph.D.: He is Professor of Department of Information and Computer Science and the director of the Institute for Software Production Technology (ISPT) of Waseda University. He received his BS in mathematics from Hokkaido University in 1965, MS in applied mathematics from Harvard University in 1972 and Ph.D. degree from Hokkaido University in 1985. He joined Hitachi Central Research Laboratory in 1965 and moved to Waseda University in 1991. He was a visiting professor of Uppsala University from 1985 to 1986 and a visiting scholar of Harvard University from 1988 to 1989. Automatic generation of computer programs and programming methodology are his main research fields. He is the inventor of the Futamura Projections in partial evaluation and ISO8631 PAD (Problem Analysis Diagram).

Zenjiro Konishi: He is a visiting lecturer of Institute for Software Production Technology, Waseda University. He received his M. Sc. degree in mathematics from Waseda University in 1995. His research interests include automated theorem proving. He received JSSST Takahashi Award in 2001. He is a member of JSSST and IPSJ.

Robert Glück, Ph.D., Habil.: He is an Associate Professor of Computer Science at the University of Copenhagen. He received his Ph.D. and Habilitation (venia docendi) from the Vienna University of Technology in 1991 and 1997. He was research assistant at the City University of New York and received twice the Erwin-Schrodinger-Fellowship of the Austrian Science Foundation (FWF). After being an Invited Fellow of the Japan Society for the Promotion of Science (JSPS), he is now funded by the PRESTO21 program for basic research of the Japan Science and Technology Corporation (JST) and located at Waseda University in Tokyo. His main research interests are advanced programming languages, theory and practice of program transformation, and metaprogramming.

About this article

Cite this article

Futamura, Y., Konishi, Z. & Glück, R. Program transformation system based on generalized partial computation. NGCO 20, 75–99 (2002). https://doi.org/10.1007/BF03037260

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037260

Keywords

Search

Navigation