Accession Number:

AD0251083

Title:

TRANSFORMATION RULES AND PROGRAM SIMPLIFICATION

Descriptive Note:

Corporate Author:

BOLT BERANEK AND NEWMAN INC CAMBRIDGE MA

Personal Author(s):

Report Date:

1961-02-07

Pagination or Media Count:

1.0

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

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE