@inproceedings{a9bcc7dc96af4a5da22915b2214b7d90,
title = "ADT implementation and completion by induction from examples",
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.",
author = "Guntis Barzdins",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 7th Workshop on Specification of Abstract Data Types, 1990 ; Conference date: 17-04-1990 Through 20-04-1990",
year = "1991",
doi = "10.1007/3-540-54496-8\_1",
language = "English",
isbn = "9783540544968",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--10",
editor = "Hartmut Ehrig and Jantke, \{Klaus P.\} and Fernando Orejas and Horst Reichel",
booktitle = "Recent Trends in Data Type Specification - 7th Workshop on Specification of Abstact Data Types, Proceedings",
address = "Germany",
}