This is a preview of subscription content, log in via an institution to check access.
References
R. Forgaard and J.V. Guttag: ”REVE: A Term Rewriting System Generator with Failure-Resistant Knuth-Bendix” Technical Report MIT-LCS (1984)
G. Huet: ”Confluent reductions: abstract properties and applications to term rewriting systems” JACM 27–4, p. 797–821 (1980)
J.P. Jouannaud and H. Kirchner: ”Completion of a set of rules modulo a set of equations” Proceedings 11th ACM Conference of Principles of Programming Languages, (1984). To appear in SIAM Journal of Computing.
C. Kirchner and H. Kirchner: ”Implementation of General Completion Procedure Parameterized by Built-in Theories And Strategies” Rapport Crin 84-R-85 (1984).
D. Knuth and P. Bendix: ”Simple Word Problems in Universal Algebras” Computational Problems in Abstract Algebra Ed. Leech J., Pergamon Press p. 263–297 (1970)
P. Lescanne: ”Computer Experiments with the REVE Term Rewriting System Generator” 10th ACM Conf. on Principles of Programming Languages Austin Texas p.99–108 (1983)
G. Peterson and M. Stickel: ”Complete sets of reduction for equational theories with complete unification algorithms” JACM 28–2, p. 233–264 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirchner, C., Kirchner, H. (1985). Implementation of a general completion procedure parameterized by built-in theories and strategies. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_296
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_296
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive