No label defined (Q3685174)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3907753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3907753 |
Statements
1985
0 references
synthesizing data type implementations
0 references
term rewriting systems
0 references
specification
0 references
proving theorems
0 references
inference rules
0 references
instantiation
0 references
simplication
0 references
expansion
0 references
hypothesis testing
0 references
0.7572227716445923
0 references
0.7563661932945251
0 references
[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.
0 references