Skip to main content
SpringerLink
Log in

Abstract data types as lattices of finitely generated models

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

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.

This research was partially sponsored by the Sonderforschungsbereich 49 — Programmiertechnik — Munich

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. Thatcher, E.G. Wagner, J.B. Wright: Specification of abstract data types using conditional axioms. IBM Research Report RC-6214, 1977

    Google Scholar 

  2. J.A. Goguen, J.W. Thatcher, E.G. Wagner: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: R.T. Yeh (ed.): Current Trends in Programming Methodology, Vol. 3, Data Structuring, N.J.: Prentice Hall, 1978

    Google Scholar 

  3. J.W. Thatcher, E.G. Wagner, J.B. Wright: Data type specification: Parameterization and the power of specification techniques. Proc. SIGACT 10th Annual Symposion on the Theory of Computing, 1978

    Google Scholar 

  4. F. L. Bauer, H. Wössner: Algorithmic language and program development. (to appear)

    Google Scholar 

  5. J.A. Bergstra, J.V. Tucker: Algebraic specifications of computable and semicomputable data structures. Afdeling Informatice Amsterdam, IW 115/79

    Google Scholar 

  6. A. Bertoni, G. Mauri, P.A. Miglioli: A characterization of abstract data as modeltheoretic invariants. In: H.A. Maurer (ed.): Proc. 6th ICALP, Graz, LNCS 71, 26–38 (1979)

    Google Scholar 

  7. A. Bertoni, G. Mauri, P.A. Miglioli, M. Wirsing: On different approaches to abstract data types and the existence of recursive models. Bulletin of EATCS 9, 47–57 (1979)

    Google Scholar 

  8. G. Birkhoff, J.D. Lipson: Heterogeneous algebras. J. of Combinatorial Theory 8, 115–133 (1970)

    Google Scholar 

  9. M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing: Existential quantifiers in abstract data types. In: H.A. Maurer (ed.): Proc. 6th ICALP, Graz, LNCS 71, 73–87 (1979)

    Google Scholar 

  10. M. Broy, M. Wirsing: Programming languages as abstract data types. In: M. Dauchet (ed.): Proc. 5th Colloquium on “Arbres en Algèbre et en Programmation”, Lille, 1980

    Google Scholar 

  11. C.C. Chang, H.J. Keisler: Model theory, Studies in Logic and Foundations of Mathematics, Vol. 73, North-Holland

    Google Scholar 

  12. B. Courcelle, I. Guessarian: On some classes of interpretations. JCSS 17: 3, 388–413 (1978)

    Google Scholar 

  13. H.D. Ehrich, V.G. Lohberger: Parametric specification of abstract data types, parameter substitution and graph replacements. Proc. Workshop “Graphentheoretische Konzepte in der Informatik”, München: Hanser-Verlag (1978)

    Google Scholar 

  14. H. Ehrig, H.J. Kreowski, P. Padawitz: Stepwise specification and implementation of abstract data types. Proc. 5th ICALP, Udine, LNCS 62, 205–226, 1978

    Google Scholar 

  15. V. Giarratana, F. Gimona, U. Montanari: Observability concepts in abstract data type specification. Proc. of the 5th MFCS Symposium, LNCS 45, 576–587 (1976)

    Google Scholar 

  16. G. Grätzer: Universal Algebra. Princeton, N.J.: van Nostrand, 1968

    Google Scholar 

  17. J.V. Guttag: The specification and application to programming of abstract data types. Ph. D. Thesis, Univ. of Toronto, Dept. of Comp. Science, Rep. CSRG-59, 1975

    Google Scholar 

  18. J.V. Guttag, J.J. Horning: The algebraic specification of abstract data types. Acta Informatica 10, 27–52 (1978)

    Google Scholar 

  19. J.V. Guttag: Notes on type abstraction. In: F.L. Bauer, M. Broy (eds.): Program Construction, LNCS 69, 593–616 (1979)

    Google Scholar 

  20. P. Lescanne: Etude algébrique et relationelle des types abstraits et de leurs representations. Dissertation, Nancy, September 1979, Rapport de Recherches 79-T-059 (1979)

    Google Scholar 

  21. M. Majster: Data types, abstract data types and their specification problem. TCS 8, 89–127 (1979)

    Google Scholar 

  22. R. Milner: Fully abstract models of typed lambda calculi. TCS 4, 1–22 (1977)

    Google Scholar 

  23. S. McLane: Categories for the working mathematician. Berlin: Springer, 1971

    Google Scholar 

  24. H. Osswald: Freie Strukturen. Zulassungsarbeit, Universität Hannover, 1966

    Google Scholar 

  25. H. Rasiowa, R. Sikorski: The mathematics of metamathematics. Monografie Matematyczne, Warszawa 1970

    Google Scholar 

  26. M. Wand: Final algebra semantics and data type extensions. Indiana University, Comp. Science Department, Technical Report No. 65, 1978

    Google Scholar 

  27. M. Wirsing: Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten. Manuscripta Mathematica 22, 13–25 (1977)

    Google Scholar 

  28. M. Wirsing: Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen. Archiv für math. Logik und Grundlagenforschung 19, 97–109 (1978)

    Google Scholar 

  29. M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract types. Technische Universität München, TUM-I 8007, May 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Postfach 20 24 20, D-8000, München 2

    M. Wirsing & M. Broy

Authors
  1. M. Wirsing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Broy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wirsing, M., Broy, M. (1980). Abstract data types as lattices of finitely generated models. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022542

Download citation

  • DOI: https://doi.org/10.1007/BFb0022542

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation