Inductive Proofs by Specification Transformation

We show how to transform equational specifications with relations between constructors (or without constructors) into order-sorted equational specifications where every function symbol is either a free constructor or a completely defined function.

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

[2]  Deepak Kapur,et al.  Inductive Reasoning with Incomplete Specifications (Preliminary Report) , 1986, LICS.

[3]  Hubert Comon,et al.  An Effective Method for Handling Initial Algebras , 1988 .

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

[5]  José Meseguer,et al.  Operational Semantics of OBJ-3 (Extended Abstract) , 1988, ICALP.

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

[7]  Satish R. Thatte.  On the Correspondence Metween Two Classes of Reduction Systems , 1985, Inf. Process. Lett..

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

[9]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

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

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

[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]  Wolfgang Küchlin,et al.  Inductive Completion by Ground Proof Transformation , 1989 .

[15]  Hubert Comon,et al.  How to characterize the language of ground normal forms , 1986 .

[16]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .

[17]  Hubert Comon.  Unification et disunification : théorie et applications , 1988 .

[18]  Jean H. Gallier,et al.  Reductions in Tree Replacement Systems , 1985, Theor. Comput. Sci..

[19]  Laurent Fribourg.  A Strong Restriction of the Inductive Completion Procedure , 1989, J. Symb. Comput..