Results 1 
2 of
2
A Transformation System for Developing Recursive Programs
, 1977
"... 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 ..."
Abstract

Cited by 639 (3 self)
 Add to MetaCart
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 !s described Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program manipulation system is lndmated KEY WORDS AND PHRASES program transformation, program mampulatlon, optimization, recursion CR CATEGORIES' 3 69, 4 12, 4 22, 5 24, 5 25 1.
AND
"... ABSTRACT Many apparently divergent approaches to specifying formal semantics of programmmg languages are applications of mmal algebra semantics In this paper an overview of imtial algebra semantics t provided The major technical feature ts an mmal continuous algebra which permits unified algebraic t ..."
Abstract
 Add to MetaCart
ABSTRACT Many apparently divergent approaches to specifying formal semantics of programmmg languages are applications of mmal algebra semantics In this paper an overview of imtial algebra semantics t provided The major technical feature ts an mmal continuous algebra which permits unified algebraic treatment of lteratlve and recurslve semantic features in the same framework as more basic operations