scientific article; zbMATH DE number 3907753
[For the entire collection see Zbl 0561.00021.] 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 are 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, simplication, expansion and hypothesis testing, 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.
- A systematic catalogue of reusable abstract data types
- Deductive and inductive synthesis of equational programs
- scientific article; zbMATH DE number 3845032 (Why is no real title available?)
- scientific article; zbMATH DE number 3911688 (Why is no real title available?)
- scientific article; zbMATH DE number 4080884 (Why is no real title available?)
- The Mechanical Transformation of Data Types
- Rewriting techniques for program synthesis
- Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685174)