@inproceedings{6bbd644726da4115b7f4bb7cbb1893b3,
title = "Abstract data types as lattices of finitely generated models",
abstract = "For abstract data types with arbitrary first order formulas properties of the equations in the axioms are studied which allow to decide whether an abstract type has initial or terminal algebras or whether it forms a complete lattice. An example of an equationally defined abstract type forming a complete lattice with nonrecursive initial and terminal models is given.",
author = "M. Wirsing and M. Broy",
note = "Publisher Copyright: {\textcopyright} 1980, Springer-Verlag.; 9th Symposium on Mathematical Foundations of Computer Science, MFCS 1980 ; Conference date: 01-09-1980 Through 05-09-1980",
year = "1980",
doi = "10.1007/BFb0022542",
language = "English",
isbn = "9783540100270",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "673--685",
editor = "P. Dembinski",
booktitle = "Mathematical Foundations of Computer Science 1980 - Proceedings of the 9th Symposium",
}