Name
Abstract | ||
|---|---|---|
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-54496-8_1 | ADT |
Keywords | Field | DocType |
adt implementation | Abstract data type,Programming language,Existential quantification,Electronic engineering,Rewriting,Normalization property,Mathematics | Conference |
Volume | ISSN | ISBN |
534 | 0302-9743 | 3-540-54496-8 |
Citations | PageRank | References |
2 | 0.43 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guntis Barzdins | 1 | 121 | 18.62 |