@inproceedings{2f5bc3376a9840539db53123ccfa5605,
title = "A decidability result about sufficient-completeness of axiomatically specified abstract data types",
abstract = "The problem of deciding whether an axiomatic specification of an abstract data type is sufficiently-complete is known to be in general unsolvable. Regarding axioms as directed rewrite rules instead of symmetric equations a specification defines a reduction relation on terms. It is proved that in the subclass of left-linear axiomatic specifications the property of sufficient-completeness is decidable, if the corresponding reduction relation is normalizing and confluent. The presented algorithm can also be used to determine a set of constructors for a specified data type.",
author = "Tobias Nipkow and Gerhard Weikum",
note = "Publisher Copyright: {\textcopyright} 1982, Springer-Verlag.; 6th GI-Conference on Theoretical Computer Science, 1983 ; Conference date: 05-01-1983 Through 07-01-1983",
year = "1982",
doi = "10.1007/BFb0036486",
language = "English",
isbn = "9783540119739",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "257--267",
editor = "Cremers, \{Armin B.\} and Hans-Peter Kriegel",
booktitle = "Theoretical Computer Science - 6th Gl-Conference",
}