Abstract
We identify the problem of automatic recursion removal using the unfold/fold methodology (2) to the problem of finding a ɛ-pattern-matcher σ for two terms t and s, i.e.so that σt=ɛs. We propose a new method to solve this equation based on a technique of dynamic completion of a term rewriting system for the property \(t = _\varepsilon s \Rightarrow t\mathop \to \limits^* _R s\). This method presentssome advantages because it enables us to work with incomplete theories and limits the number of superpositions we must do during the process of completion.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
6.References
J. Arsac and Y. Kodratoff: "Some methods for transforming recursive procedures into iterative ones", to appear ACM ToPLaS.
R. Burstall and J. Darlington: 1977, "A transformation system for developping recursive programs", J.ACM,vol.24,no.1.
E. Costa: 1981, "Dérecursivation automatique en utilisant des systèmes de réécriture de termes", thèse de 3ème cycle,Univ. de Paris VI.
J. Darlington: 1981, "The synthesis of implementations for abstract data types", Nato Summer School on Automatic Program Construction, Bonas,France.
M. Fay: 1979, "First-order unification in an equational theory", Proc. of the 4th Workshop on Automated Deduction,Austin,Texas.
P. Gloess and J.-P. Laurent: 1980,"Adding dynamic paramodulation to rewrite algorithms",Proc. of the 5th Conference on Automated Deduction,Les Arcs,France.
G. Huet and D. Oppen: 1980,"Equations and rewrite rules.a survey",SRI International Technical Report CSL-111.
J. Hullot. 1980,"Compilation des formes canoniques dans des théories équationnelles", thèse de 3ème cycle,Univ. de Paris-Sud.
D. Knuth and P. Bendix: 1970,"Simple word problems in universal algebras", in "Computational problems in abstract algebra",ed. J. Leech,Pergamon Press.
Z. Manna,S. Ness and J. Vuillemin: 1973,"Inductive methods for proving properties of programs",C. ACM,vol.16,no.8.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costa, E.J.F. (1982). Automatic program transformation viewed as theorem proving. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-11494-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11494-9
Online ISBN: 978-3-540-39184-5
eBook Packages: Springer Book Archive