This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Arsac, La construction de programmes structures, Dunod, Paris, 1977.
L. Bachmair and D. Plaisted, ”Associative Path Orderings,” in Proc. 1st Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 241–254, Springer Verlag, Dijon (France), 1985.
John Backus, ”Function Level Programs As Mathematical Objects,” Proceedings of the Conference on Functional Programming Languages And Computer Architecture, Portmouth, New Hampssire, pp. 1–10, Oct. 1981.
John Backus, ”The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, And Extended Definitions,” Proceedings International Colloquium on the Formalization of Programming Concepts, Peniscola, Spain, vol. 107, pp. 1–43, Springer-Verlag, April 1981.
J. Backus, ”Can Programming Be Liberated From the Von Neumann Style? A Functional Style And Its Algebra of Programs,” Comm. of ACM, vol. 21, no. 8, pp. 613–641, 1978.
F. L. Bauer, M. Broy, N. Partsh, P. Pepper, and H. Wossner, Systematics Transformation Rules, Lecture Notes in Computer Science, 69, Springer-Verlag, 1979.
F. Bellegarde, ”Rewriting Systems on FP Expressions that Reduce the Number of Sequences they yield,” in Symposium on LISP and Functional Programming, ACM, Austin, USA, 1984.
F. Bellegarde, ”Utilisation des Systèmes de Réécriture d'Expressions Fonctionnelles comme outils de Transformation de Programmes Itératifs,” Thèse de doctorat d'Etat, Université de Nancy I, 1985.
R.M. Burstall and J. Darlington, ”A Transformation System for Developping Recursive Programs,” J of ACM, vol. 24, pp. 44–67, 1977.
E. W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.
R. Forgaard and J.V. Guttag, ”REVE: A Term Rewriting System Generator with Failure-Resistant Knuth-Bendix,” MIT-LCS, 1984.
J. S. Gilver and R. B. Kieburz, ”Schema Recognition for Program Transformations,” ACM Symposium on Lisp and Functional Programming, pp. 74–84, Austin, 1984.
I. Gnaedig and P. Lescanne, ”Rewriting Systems for proving termination of rewriting systems,” a paraitre, 1985.
J. Guyard and J. P. Jacquot, ”MAIDAY: An environment for Guided Programming with a definitional language,” Conf. Genie Logiciel, Orlando, 1984.
G. Huet, ”Confluent reductions: abstract properties and applications to term rewriting systems,” J. of ACM, vol. 27, no. 4, pp. 797–821, Oct. 1980.
S. Kaplan, ”Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence,” Laboratoire de Recherche en Informatique, Universite d'Orsay (France), Orsay, 1984.
Richard B. Kieburtz, ”Transformations of FP Program Schemes,” Proceedings of the Conference on Functional Programming Languages And Computer Architecture, Port-mouth, New Hampshire, pp. 41–48, Oct. 1981.
C. Kirchner, ”Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles,” Thèse de doctorat d'Etat, Université de Nancy I, 1985.
H. Kirchner, ”Preuves par complétion dans les variétés d'algèbres,” Thèse de doctorat d'Etat, Université de Nancy I, 1985.
D. Knuth and P. Bendix, ”Simple Word Problems in Universal Algebras,” Computational Problems in Abstract Algebra Ed. Leech J., Pergamon Press, pp. 263–297, 1970.
D.S. Lankford, ”On Proving Term Rewriting Systems Are Noetherian,” Report Mtp-3, Math. Dept., Louisiana Tech University, May 1979.
P. Lescanne, ”Computer Experiments with the REVE Term Rewriting System Generator,” in 10th ACM Conf. on Principles of Programming Languages, pp. 99–108, Austin Texas, January 1983.
P. Lescanne, ”Uniform termination of term rewriting systems — Recursive decomposition ordering with status,” Proceedings 9th Colloque les Arbres en Algebre et en Programmation, pp. 182–194, Cambridge University Press, Bordeaux (France), 1984.
U. S. Reddy, ”Programming with Sequences,” ACM Southest Regional Conf., 1982.
J.L. Remy and H. Zhang, ”REVEUR 4: a System for Validating Conditional Algebraic Specifications of Abstract Data Types,” Proceedings of the 5th ECAI, Pisa, 1984.
P. Wadler, ”Applicative Style Programming, Program Transformation, And List Operators,” Proceedings of the Conference on Functional Programming Languages And Computer Architecture, Portmouth, New Hampshire, pp. 25–32, Oct. 1981.
B. Wegbreit, ”Goal Directed Program Transformation,” IEEE Trans. on Software Engineering, vol. 2, pp. 69–80, 1976.
N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall series in Automatic Computation, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellegarde, F. (1986). Convergent term rewriting systems can be used for program transformation. In: Ganzinger, H., Jones, N.D. (eds) Programs as Data Objects. Lecture Notes in Computer Science, vol 217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16446-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-16446-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16446-3
Online ISBN: 978-3-540-39786-1
eBook Packages: Springer Book Archive