On sufficient-completeness and related properties of term rewriting systems

SummaryThe decidability of the sufficient completeness property of equational specifications satisfying certain conditions is shown. In addition, the decidability of the related concept of quasi-reducibility of a term with respect to a set of rules is proved. Other results about irreducible ground terms of a term rewriting system also follow from a key technical lemma used in these decidability proofs; this technical lemma states that there is a finite bound on the substitutions of ground terms that need to be considered in order to check for a given term, whether the result obtained by any substitution of ground terms into the term is irreducible. These results are first shown for untyped systems and are subsequently extended to typed systems.

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

[2]  Paliath Narendran,et al.  A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System , 1985, Theor. Comput. Sci..

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

[4]  Paliath Narendran,et al.  Complexity of Certain Decision Problems about Congruential Languages , 1985, J. Comput. Syst. Sci..

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

[6]  Ronald V. Book,et al.  Confluent and Other Types of Thue Systems , 1982, JACM.

[7]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[8]  Emmanuel Kounalis,et al.  Completeness in Data Type Specifications , 1985, European Conference on Computer Algebra.

[9]  John V. Guttag,et al.  The specification and application to programming of abstract data types. , 1975 .

[10]  Tobias Nipkow,et al.  A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983, Theoretical Computer Science.

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

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

[13]  Gérard P. Huet,et al.  Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.

[14]  James J. Horning,et al.  The algebraic specification of abstract data types , 1978, Acta Informatica.

[15]  Paliath Narendran.  Church-rosser and related thue systems (word problem, rewrite rules, congruence) , 1984 .

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

[17]  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 .

[18]  Jean-Jacques Thiel.  Stop losing sleep over incomplete data type specifications , 1984, POPL '84.

[19]  H. Comon.  Sufficient Completness, Term Rewriting Systems and Anti-Unification , 1986 .

[20]  Friedrich Otto,et al.  Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems , 1984, Theor. Comput. Sci..

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

[22]  Nachum Dershowitz,et al.  Computing with Rewrite Systems , 1985, Inf. Control..

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