@inproceedings{71dfec032aa444398a8841f53b9fdf2a,
title = "On the algebraic extensions of abstract data types",
author = "Manfred Broy and Martin Wirsing",
note = "Funding Information: For every finitely generated E-algebra A the set F obviously is a construc$~r set and for W(Z) it is a minimal constructor set. A minimal constructor set F'is called u~.~if the syntactical equality in W((S,F')) and the equality in A coincide. ~n analogy to the Egli-Milner ordering for nondeterministic expressions (cf. /P76/) one can relate constructor sets and the subterm ordering. Let C be a constructor set and E ~ = (S,C). For two terms tl,t2 ~ W(~) we define *) This work has been partially sponsored by the Sonderforschungsbereich 49, Programmiertechnik, M~nchen **) Present Address: Dept. of Computer Science, University of Edinburgh, Mayfield Road, Edinburgh EH9 3JZ, Scotland.; 1st International Colloquium on the Formalization of Programming Concepts, ICFPC 1981 ; Conference date: 19-04-1981 Through 25-04-1981",
year = "1981",
doi = "10.1007/3-540-10699-5_101",
language = "English",
isbn = "9783540106999",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "244--251",
editor = "Josep D{\'i}az and Isidro Ramos",
booktitle = "Formalization of Programming Concepts - International Colloquium, Proceedings",
}