ASTRE: Towards a fully automated program transformation system

  • F. Bellegarde
System Description
Part of the Lecture Notes in Computer Science book series (LNCS, volume 914)


Astre has achieved its initial goal: it is fully automatic for deforestation and two-loops fusion of functional programs. Other fully automatic algorithms for deforestation does not include two-loops fusion. They reject all deforestations that necessitate laws but Astre can perform most of them using additional synthesis. Moreover they do not extend easily to include laws or other strategies. The limitation of Astre is the termination obligation of the input rewrite system. Also Astre does not process easily a large amount of rules. The present prototype has been used so far up-to 500 rules input. At this size, it becomes intractable to perform all the syntheses. We plan to automatize derecursion tactical and automatic insertion of laws [3] in a near future.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Bell et al. Software Design for Reliability and Reuse: A proof-of-concept demonstration. In TRI-Ada '94 Proceedings, pages 396–404. ACM, November 1994.Google Scholar
  2. 2.
    F. Bellegarde. Program Transformation and Rewriting. In Proceedings of the fourth conference on Rewriting Techniques and Applications, volume 488 of LNCS, pages 226–239. Springer-Verlag, 1991.Google Scholar
  3. 3.
    F. Bellegarde. A transformation system combining partial evaluation with term rewriting. In Higher Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of LNCS, pages 40–58. Springer-Verlag, September 1993.Google Scholar
  4. 4.
    F. Bellegarde. Termination issues in automated syntheses. Technical report, Department of Computer Science and Engineering, Oregon Graduate Institute, September 1994.Google Scholar
  5. 5.
    R. M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal of the ACM, 24:44–67, 1977.CrossRefGoogle Scholar
  6. 6.
    W. Chin. Safe Fusion of Functional Expressions II: Further Improvements. Journal of Functional Programming, 11:1–40, 1994.Google Scholar
  7. 7.
    W. Chin and J. Darlington. Higher-Order Removal: A modular approach. Unpublished work, 1993.Google Scholar
  8. 8.
    N. Dershowitz. Completion and its Applications. In Resolution of Equations in Algebraic Structures. Academic Press, New York, 1988.Google Scholar
  9. 9.
    S. Thompson. Type Theory and Functional Programming. Addison Wesley, 1991.Google Scholar
  10. 10.
    P. Wadler. Deforestation: Transforming Programs to eliminate trees. In Proceedings of the second European Symposium on Programming ESOP'88, volume 300 of LNCS. Springer-Verlag, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • F. Bellegarde
    • 1
  1. 1.Pacific Software Research CenterOregon Graduate Institute of Science & TechnologyUSA

Personalised recommendations