Advertisement

Generalized heterogeneous algebras and partial interpretations

  • Manfred Broy
  • Martin Wirsing
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)

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.

Keywords

Isomorphism Class Partial Function Complete Lattice Great Element Generalize Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ADJ 75]
    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–95CrossRefGoogle Scholar
  2. [ADJ 78]
    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–101Google Scholar
  3. [Birkhoff, Lipson 70]
    G. Birkhoff, J.D. Lipson: Heterogeneous algebras. J. of Combinatorial Theory 8, 115–133 (1970)Google Scholar
  4. [Broy, Wirsing 80]
    M. Broy, M. Wirsing: Programming languages as abstract data types. M. Dauchet (ed.): 5ème CAAP, Lille, February 1980, Université de Lille 1980, 160–177Google Scholar
  5. [Broy, Wirsing 81]
    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–251Google Scholar
  6. [Broy, Wirsing 82]
    M. Broy, M. Wirsing: Partial abstract data types. Acta Informatica 18:1, November 1982, 47–64CrossRefGoogle Scholar
  7. [Grätzer 68]
    G. Grätzer: Universal algebra. Princeton: Van Nostrand, 1968Google Scholar
  8. [Kleene 52]
    S.C. Kleene: Introduction to metamathematics. New York: Van Nostrand 1952Google Scholar
  9. [Manna 74]
    Z. Manna: Mathematical theory of computation. New York: McGraw Hill 1974Google Scholar
  10. [Milner 77]
    R. Milner: Fully abstract models of typed λ-calculi. TCS 4, 1–22(1977)CrossRefGoogle Scholar
  11. [Möller 82]
    B. Möller: Unendliche Objekte und Geflechte. Technische Universität München, Institut für Informatik, TUM-18213, Ph. D. Thesis 1982Google Scholar
  12. [Scott 70]
    D. Scott: Outline of a mathematical theory of computation. Proc. 4th Annual Princeton Conference on Information Sciences and Systems 1970, 169–176Google Scholar
  13. [Wirsing, Broy 80]
    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–685Google Scholar
  14. [Wirsing et al. 80]
    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 1980Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Manfred Broy
    • 1
  • Martin Wirsing
    • 1
  1. 1.Fakultät für InformatikUniversität PassauPassau

Personalised recommendations