A Strong Restriction of the Inductive Completion Procedure

[1]  Yoshihito Toyama,et al.  How to Prove Equivalence of Term Rewriting Systems Without Induction , 1986, Theor. Comput. Sci..

[2]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[3]  Wolfgang Küchlin,et al.  Inductive Completion by Ground Proof Transformation , 1989 .

[4]  Leo Bachmair,et al.  Proof by consistency in equational theories , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Leo Bachmair.  Proof methods for equational theories , 1987 .

[6]  Richard Göbel,et al.  Ground Confluence , 1987, RTA.

[7]  Paliath Narendran,et al.  Proof by Induction Using Test Sets , 1986, CADE.

[8]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[9]  Douglas R. Smith.  Reasoning by Cases and the Formation of Conditional Programs , 1985, IJCAI.

[10]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[11]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[12]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[13]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[14]  Laurent Fribourg,et al.  Oriented Equational Clauses as a Programming Language , 1984, J. Log. Program..

[15]  Laurent Fribourg,et al.  A Narrowing Procedure for Theories with Constructors , 1984, CADE.

[16]  Hélène Kirchner,et al.  Completion of a set of rules modulo a set of equations , 1984, SIAM J. Comput..

[17]  Hantao Zhang,et al.  REVEUR 4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types , 1984, ECAI.

[18]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[19]  Zohar Manna,et al.  Deductive Synthesis of the Unification Algorithm , 1981, Sci. Comput. Program..

[20]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[21]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[22]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[23]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[24]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[25]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[26]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[27]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[28]  Raymond AUBIN,et al.  Mechanizing Structural Induction Part I: Formal System , 1979, Theor. Comput. Sci..

[29]  Raymond Aubin,et al.  Mechanizing Structural Induction Part II: Strategies , 1979, Theor. Comput. Sci..

[30]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[31]  Raymond Aubin,et al.  Mechanizing structural induction , 1976 .

[32]  James R. Slagle,et al.  Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.

[33]  Karl N. Levitt,et al.  Reasoning about programs , 1973, Artif. Intell..

[34]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[35]  Rod M. Burstall,et al.  Proving Properties of Programs by Structural Induction , 1969, Comput. J..