Advertisement

Algebraic specification with built-in domain constructions

  • Bernhard Möller
  • Andrzej Tarlecki
  • Martin Wirsing
Algebraic Specifications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 299)

Abstract

A way of integrating predefined data type constructions into the framework of algebraic specifications is proposed in such a way that some standard results such as existence of initial and terminal algebras for hierarchical specifications are preserved. A general technique is presented which includes as special cases higher-order function spaces, cartesian products and standard power-set constructions. The central idea is to employ the generation principle also for the built-in constructions; this means that e.g. in the higher-order case not all functions use considered but only those that can be denoted by terms. This leads to a particularly simple theory by which the extended specifications can be related to the usual first-order ones.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bauer, Wössner 82]
    F.L. Bauer, H. Wössner: Algorithmic Language and Program Development. Berlin: Springer, 1982.Google Scholar
  2. [Broy et al. 84]
    M. Broy, C. Pair, M. Wirsing: A systematic study of models of abstract data Types. Theoretical Computer Science 33, 1984, 139–174.Google Scholar
  3. [Broy 86]
    M. Broy: Partial interpretations of higher order algebraic types. Lecture Notes of the International Summer School on Logic of Programming and Calculi of Discrete Design, Marktoberdorf, 1986.Google Scholar
  4. [Burstall, Goguen 80]
    R.M. Burstall, J.A. Goguen: The semantics of CLEAR, a specification language. Proc. Advanced Course on Abstract Software Specifications, Copenhagen. Lecture Notes in Computer Science 86, Berlin: Springer, 1980, 292–332.Google Scholar
  5. [Ehrig, Mahr 85]
    H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1. EATCS Monographs on Theoretical Computer Science 6, Berlin: Springer, 1985.Google Scholar
  6. [Keisler 71]
    H.J. Keisler: Model Theory for Infinitary Logic. Studies in Logic and Foundations of Mathematics, Vol. 62, 1971.Google Scholar
  7. [Mahr, Makowsky 84]
    B. Mahr, J.A. Makowsky: Characterising specification languages which admit initial semantics, Theoretical Computer Science 31, 1984, 49–59.Google Scholar
  8. [Milner 77]
    R. Milner: Fully abstract semantics of typed λ-calculi. Theoretical Computer Science 4, 1977, 1–22.Google Scholar
  9. [Möller 86]
    B. Möller: Algebraic specifications with higher-order operators. In: L. Meertens (ed.): Proc. IFIP TC2 Working Conference on Program Specification and Transformation, Bad Tölz, April 1986. Amsterdam: North-Holland, 1987, 367–392.Google Scholar
  10. [Möller 87]
    B. Möller: Higher-order algebraic specifications. Fakultät für Mathematik und Informatik der TU München, Habilitationsschrift, 1987.Google Scholar
  11. [Plotkin 77]
    G.D. Plotkin: LCF considered as a programming language. Theoretical Computer Science 4, 1977, 223–255.Google Scholar
  12. [Poigné 86]
    A. Poigné: On specifications, theories, and models with higher types. Information and Control 68, 1986, 1–46.Google Scholar
  13. [Tarlecki 85]
    A. Tarlecki: On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37, 1985, 269–304.Google Scholar
  14. [Tarlecki 86]
    A. Tarlecki: Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences 33, 1986, 333–360.Google Scholar
  15. [Tarlecki, Wirsing 86]
    A. Tarlecki, M. Wirsing: Continuous abstract data types. Fundamenta Informaticae 9, 1986, 95–125.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Bernhard Möller
    • 1
  • Andrzej Tarlecki
    • 2
  • Martin Wirsing
    • 3
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2
  2. 2.Polish Academy of SciencesInstitute of Computer ScienceWarsaw, PKiN
  3. 3.Fakultät für Mathematik und InformatikPassau

Personalised recommendations