Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)
Implementation of a general completion procedure parameterized by built-in theories and strategies
KeywordsEquational Theory Abstract Property Commutative Monoid Completion Process Extension Rule
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.
Unable to display preview. Download preview PDF.
- R. Forgaard and J.V. Guttag: ”REVE: A Term Rewriting System Generator with Failure-Resistant Knuth-Bendix” Technical Report MIT-LCS (1984)Google Scholar
- G. Huet: ”Confluent reductions: abstract properties and applications to term rewriting systems” JACM 27–4, p. 797–821 (1980)Google Scholar
- 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.Google Scholar
- C. Kirchner and H. Kirchner: ”Implementation of General Completion Procedure Parameterized by Built-in Theories And Strategies” Rapport Crin 84-R-85 (1984).Google Scholar
- 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)Google Scholar
- 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)Google Scholar
- G. Peterson and M. Stickel: ”Complete sets of reduction for equational theories with complete unification algorithms” JACM 28–2, p. 233–264 (1981)Google Scholar
© Springer-Verlag Berlin Heidelberg 1985