Abstract data types as lattices of finitely generated models

M. Wirsing, M. Broy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 1980 - Proceedings of the 9th Symposium
EditorsP. Dembinski
PublisherSpringer Verlag
Pages673-685
Number of pages13
ISBN (Print)9783540100270
DOIs
StatePublished - 1980
Event9th Symposium on Mathematical Foundations of Computer Science, MFCS 1980 - Rydzyna, Poland
Duration: 1 Sep 19805 Sep 1980

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume88 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Symposium on Mathematical Foundations of Computer Science, MFCS 1980
Country/TerritoryPoland
CityRydzyna
Period1/09/805/09/80

Fingerprint

Dive into the research topics of 'Abstract data types as lattices of finitely generated models'. Together they form a unique fingerprint.

Cite this