Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M.A. Ardis, ”Data Abstraction Transformations,” Technical Report TR-925, University of Maryland, Maryland (USA), 1980.
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.
J.Y. Cras, ”Conception d'un système modulaire traitant le cas de non-convergence de l'algorithme de Knuth-Bendix,” Rapport de stage, Ecole Centrale des Arts et Manufactures, Chatenay-Malabry, 1983.
N. Dershowitz and L. Marcus, ”Existence And Construction of Rewrite Systems,” Research Report, University of Illinois, USA, 1982.
K. Drosten, ”Term Rewriting Systems with Restricted Variables,” Bericht Nr.85-11, Institut fur Informatik, Braunschweig, 1985.
M. Fay, ”First-Order Unification in an Equational Theory,” Proceedings of the 4th Workshop on Automated Deduction, pp. 161–167, Austin, Texas, 1979.
M. Hermann and I. Privara, ”On nontermination of Knuth-Bendix algorithm,” Research Report VUSEI-AR-OPS-3/85, Institute of Socio-Economic Information and Automation, CS-842 21 Bratislava (Czechoslovakia), 1985.
G. Huet, ”Confluent reductions: abstract properties and applications to term rewriting systems,” J. of ACM, vol. 27, no. 4, pp. 797–821, Oct. 1980.
G. Huet, ”A complete proof of correctness of the Knuth-Bendix completion algorithm,” J. Comp. Sys. Sc., vol. 23, no. 1, pp. 11–21, Aug. 1981.
J.M. Hullot, ”Canonical Forms And Unification,” in Proceedings of the Fifth Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 87, pp. 318–334, Springer-Verlag, Les Arcs, France, July 1980.
J.Jouannaud and H.Kirchner, ”Completion of a set of rules modulo a set of equations,” SIAM J. of Computing, vol. 15(4), 1986.
J.P. Jouannaud and Y. Kodratoff, ”Program Synthesis From Example of Behaviour,” Proc. of the International Workshop on Program Construction. Chateau De Bonas. Ed. Biermann And Guiho. Reidel Publish, 1981.
J. P. Jouannaud, C. Kirchner, and H. Kirchner, ”Incremental Construction of Unification Algorithms in Equational Theories,” in Proceedings of the International Conference On Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 154, pp. 361–373, Springer-Verlag, Barcelona Spain, 1983.
C. Kirchner and H. Kirchner, ”Contribution à la résolution d'équations dans les algèbres libres et les variétés équationnelles d'algèbres,” Thèse de 3ème cycle, Université de Nancy I, 1982.
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.
G. Peterson and M. Stickel, ”Complete sets of reduction for equational theories with complete unification algorithms,” J. of ACM, vol. 28, no. 2, pp. 233–264, 1981.
P. Rety, C. Kirchner, H. Kirchner, and P. Lescanne, ”NARROWER: A new Algorithm for Unification and its application to Logic Programming,” in Proc. lrst Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, pp. 141–157, Springer-Verlag, Dijon (France), 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirchner, H. (1987). Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive