Theory of linear equations applied to program transformation

Authors:
Uday S. Reddy;Barat Jayaraman
Affiliations:
University of Utah, Salt Lake City;University of North Carolina at Chapel Hill
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Year:
1983

Citing 9
Cited 0

A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
A System for Assisting Program Transformation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Some Techniques for Recursion Removal from Recursive Functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Development of the Algebra of Functional Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Fixpoint approach to the theory of computation

Communications of the ACM
Programming with sequences

ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts
Transformations of FP program schemes

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper is presented a technique for transforming a class of recursive equations called linear equations into iterative equations. Linear equations are characterized by involving at the most one recursive call for any invocation. In contrast to the conventional techniques, the scheme of program transformation presented here involves finding the solution of the given linear equation and transforming this solution. The solutions of linear equations can always be expressed using a construct called abstract sequence. Two classes of abstract sequence programs are identified: right-associative and left-associative sequence programs. The former are obtained by solving linear equations and the latter correspond to iterative programs. The task of transforming linear recursive programs into iterative programs is thus reduced to the task of transforming right-associative sequence programs into left associative ones. Various transformation rules are developed based on an algebra of functional programs.