TRSPEC: A Term Rewriting Based System for Algebraic Specifications

[1]  Richard Göbel.  Completion of Globally Finite Term Rewriting Systems for Inductive Proofs , 1985, GWAI.

[2]  Jürgen Müller,et al.  Effiziente Reduktionsstrategien in Termersetzunssystemen , 1986, GWAI.

[3]  Laurent Fribourg,et al.  A Strong Restriction of the Inductive Completion Procedure , 1986, J. Symb. Comput..

[4]  Rüdiger Göbel,et al.  TRSPEC: A Term Rewriting Based System for Algebraic Specifications , 1986, CADE.

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

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

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

[8]  Richard Göbel.  Rewrite Rules with Conditions for Algebraic Specifications , 1983, ADT.

[9]  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).

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

[11]  Pierre Lescanne,et al.  An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations , 1986, CADE.

[12]  Harald Ganzinger.  Ground Term Confluence in Parametric Conditional Equational Specifications , 1987, STACS.

[13]  Isabelle Gnaedig,et al.  Proving Termination of Associative Commutative Rewriting Systems by Rewriting , 1986, CADE.