A Transformation System for Developing Recursive Programs

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

  • Affiliations:
  • Department of Artificial Intelligence, Edinburgh University, Hope Park Square-Meadow Lane, Edinburgh EH8 9NW, Scotland;Department of Artificial Intelligence, Edinburgh University, Hope Park Square-Meadow Lane, Edinburgh EH8 9NW, Scotland

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1977

Quantified Score

Hi-index 0.07

Visualization

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.