Affiliation:
1. Department of Artificial Intelligence, University of Edinburgh, Edinburgh EH8 9NW
Abstract
The paper describes a system of rules for transforming programs, the programs being in the form of recursion equations. The idea is to start with a very simple, lucid and hopefully correct program, then to transform it into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. We hope to throw some light on the alternative structures for programs, also to indicate a possible initial phase for an automatic or semi-automatic program manipulation system.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Refactoring tools for functional languages;Journal of Functional Programming;2013-05
2. A fold/unfold transformation framework for rewrite theories extended to CCT;Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation - PEPM '10;2010
3. Constructive Methods of Program Design;Pioneers and Their Contributions to Software Engineering;2001
4. Rules and strategies for transforming functional and logic programs;ACM Computing Surveys;1996-06
5. Continuous Data Types;SIAM Journal on Computing;1982-05