A rewrite rule based approach for synthesizing abstract data types [chapter]

Deepak Kapur, Mandayam Srivas
1985 Lecture Notes in Computer Science  
An approach for synthesizing data type implementations based on the theory of term rewriting systems is presented. A specification is assumed to be given as a system of equations; an implementation is derived from the specification as another system of equations. The proof based approach used for the synthesis consists of reversing the process of proving theorems (i.e. searching for appropriate theorems rather than proving the given ones). New tools and concepts to embody this reverse process
more » ... e developed. In particular, the concept of expansion, which is a reverse of rewriting (or reduction), is defined and analyzed. The proposed system consists of a collection of inference rules -instantiation, simplification, expansion and hypothesis tesing, and two strategies for searching for theorems depending upon whether the theorem being looked for is in the equational theory or in the inductive theory of the specification.
doi:10.1007/3-540-15198-2_12 fatcat:g567653hcvcsvhtplubgqwkoly