Affiliation:
1. Department of Artificial Intelligence, Edinburgh University, Hope Park Square-Meadow Lane, Edinburgh EH8 9NW, Scotland
Abstract
A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program-manipulation system is indicated.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
838 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing Intermediate Data Structures;Proceedings of the ACM on Programming Languages;2024-08-15
2. Incremental Computation: What Is the Essence? (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11
3. A Historical Perspective on Program Transformation and Recent Developments (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11
4. Asynchronous unfold/fold transformation for fixpoint logic;Science of Computer Programming;2024-01
5. Towards Specification-Guarded Refactoring;Lecture Notes in Computer Science;2024