A Transformation System for Developing Recursive Programs

  • R. M. Burstall
    Department of Artificial Intelligence, Edinburgh University, Hope Park Square-Meadow Lane, Edinburgh EH8 9NW, Scotland
  • John Darlington
    Department of Artificial Intelligence, Edinburgh University, Hope Park Square-Meadow Lane, Edinburgh EH8 9NW, Scotland

書誌事項

公開日
1977-01
権利情報
  • https://www.acm.org/publications/policies/copyright_policy#Background
DOI
  • 10.1145/321992.321996
公開者
Association for Computing Machinery (ACM)

この論文をさがす

説明

<jats:p>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.</jats:p>

収録刊行物

  • Journal of the ACM

    Journal of the ACM 24 (1), 44-67, 1977-01

    Association for Computing Machinery (ACM)

被引用文献 (25)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ