Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Toward automatic program synthesis
Communications of the ACM
Computer architecture for correct programming
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Programming as an evolutionary process
ICSE '76 Proceedings of the 2nd international conference on Software engineering
A laboratory for the study of automating programming
ACM SIGSAM Bulletin
Record of the Project MAC conference on concurrent systems and parallel computation
A laboratory for the study of automating programming
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A system which automatically improves programs
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.02 |
This paper proposes the foundations for a systematic study of the translation of recursive function definitions into flow charts (often called the removal of recursions). Several notions of translation are presented. Emphasis is placed on translation which could be performed mechanically, operating only on the syntactical structure of the recursion equations. Systems of recursion equations are classified by structure and by the dynamics of their implicit computations. Theorems on the limitations of translation are based on these classifications. An effective first approximation to a syntactic characterization of one notion of translatability is presented. Finally, open problems are discussed. Space limitations prevent the inclusion of proofs or lengthy definitions.