Equivalence of Some Classes of Algorithms.
Abstract
A class of iterated arrays is defined, and the conditions under which it can be represented alternately by a recursive definition scheme are considered. Each such array or alternately the corresponding recursive definition is viewed as being a description of a class of equivalent program schemes; each member of this latter class being a sequence of assignment statements. When and how these equivalent sequences of assignment statements can be more compactly described by use of a DO statement is considered. This approach gives techniques for deciding equivalences between programs containing assignment and simple DO statements, as well as for deciding in some cases whether a recursively defined function can be implemented with DO loops. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1971
- Accession Number
- AD0732306
Entities
People
- Marvin C. Paull
Organizations
- Rutgers University Department of Computer Science