TRANSFORMATION RULES AND PROGRAM SIMPLIFICATION
Abstract
Consideration was given to an approach to the problem of program simplification. The essential idea is to perform manipulations, through a set of transformation rules, on a given class of function-representing expressions (which we call F-expressions), thereby producing equivalent F-expressions form which better programs may be generated. The first part of the report defines the F-expressions and discusses in general terms the process of using transformation rules to perform a systematic search for the best F-expression equivalent to the given one. An application off this sch scheme is given. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 07, 1961
- Accession Number
- AD0251083
Entities
People
- T.g. Evans
- Thomas Marill
Organizations
- BBN Technologies