A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A rewrite rule based approach for synthesizing abstract data types
[chapter]
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
doi:10.1007/3-540-15198-2_12
fatcat:g567653hcvcsvhtplubgqwkoly