Some transformations for developing recursive programs

  • Authors:
  • R. M. Burstall;John Darlington

  • Affiliations:
  • Department of Artificial Intelligence, University of Edinburgh, Edinburgh EH8 9NW;Department of Artificial Intelligence, University of Edinburgh, Edinburgh EH8 9NW

  • Venue:
  • Proceedings of the international conference on Reliable software
  • Year:
  • 1975

Quantified Score

Hi-index 0.04

Visualization

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.