Skip to main content

Generalized heterogeneous algebras and partial interpretations

  • Invited Lectures
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

Abstract

A notion of heterogeneous algebras generalizing the concepts of total, partial and regular algebras is introduced consisting of a family of carrier sets, a family of total functions and a family of definedness predicates. Partial interpretations are families of partial functions mapping such generalized algebras homomorphically onto partial heterogeneous algebras. Classes of generalized algebras can be specified equationally by generalized abstract types. This notion of abstract type is particularly well suited for the description of programming languages since the notion of homomorphism between generalized algebras allows to obtain fully abstract models in a uniform way — as weakly terminal models. Sufficient conditions for the existence of initial and terminal models and interpretations are given, the model classes of generalized abstract types is analysed using lattice-theoretic methods and the relationship to the classical concept of partial functions is explained. The main advantage of this approach — a uniform treatment of "strict" and "nonstrict" functions — is shown by an extended example where all recursively enumerable (finite and infinite) sequences of natural numbers are specified as a generalized abstract type with nonstrict basic functions.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright: Initial algebra semantics and continuous algebras. IBM Research Report RC-5701, November 1975, rJACM 24 (1977) pp. 68–95

    Article  Google Scholar 

  2. E.G. Wagner, J.W. Thatcher, J.B. Wright: Programming languages as mathematical objects. J. Winkowski (ed.): Proc. Math. Foundations of Computer Science, Zakopane 1978, Lecture Notes in Computer Science 64, Berlin: Springer, 84–101

    Google Scholar 

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

    Google Scholar 

  4. M. Broy, M. Wirsing: Programming languages as abstract data types. M. Dauchet (ed.): 5ème CAAP, Lille, February 1980, Université de Lille 1980, 160–177

    Google Scholar 

  5. M. Broy, M. Wirsing: On the algebraic extensions of abstract data types. J. Diaz, I. Ramos (eds.): International Colloquium on Formalization of Programming Concepts, Peniscola, April 1981, Lecture Notes in Computer Science 107, Berlin-Heidelberg-New York: Springer 1981, 244–251

    Google Scholar 

  6. M. Broy, M. Wirsing: Partial abstract data types. Acta Informatica 18:1, November 1982, 47–64

    Article  Google Scholar 

  7. G. Grätzer: Universal algebra. Princeton: Van Nostrand, 1968

    Google Scholar 

  8. S.C. Kleene: Introduction to metamathematics. New York: Van Nostrand 1952

    Google Scholar 

  9. Z. Manna: Mathematical theory of computation. New York: McGraw Hill 1974

    Google Scholar 

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

    Article  Google Scholar 

  11. B. Möller: Unendliche Objekte und Geflechte. Technische Universität München, Institut für Informatik, TUM-18213, Ph. D. Thesis 1982

    Google Scholar 

  12. D. Scott: Outline of a mathematical theory of computation. Proc. 4th Annual Princeton Conference on Information Sciences and Systems 1970, 169–176

    Google Scholar 

  13. M. Wirsing, M. Broy: Abstract data types as lattices of finitely generated models. In: Dembinski, P. (ed.): Mathematical Foundations of Computer Science — 9th Symposium, Rydzyna, Poland, Sept. 1–5, 1980. Lecture Notes in Computer Science 88. Berlin-Heidelberg-New York: Springer 1980, p. 673–685

    Google Scholar 

  14. M. Wirsing, P. Pepper. H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Technische Universität Muenchen, Institut für Informatik, TUM-I8007, May 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broy, M., Wirsing, M. (1983). Generalized heterogeneous algebras and partial interpretations. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics