Characterizing specification languages which admit initial semantics

  • B. Mahr
  • J. A. Makowsky
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)


The paper proposes a unified approach to study and compare specification techniques and languages. It is devided into two parts: (1) A general notion of specification language is given which provides an axiomatic framework for the various known specification techniques. (2) Algebraic specification languages which admit initial semantics are characterized up to equivalence. They are shown to be exactly the implicational languages.


Specification Language Universal Algebra Free Algebra Abstract Data Type Horn Formula 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ADJ75]
    Goguen, J., Thatcher, J., Wagner, E., Wright, J.B.: "Abstract Data Types as Initial Algebras and Correctness of Data Representations", Proc. Conf. on Comp. Graphics, Pattern Recognition and Data Structures, May 1975, pp. 89–93.Google Scholar
  2. [ADJ78]
    Goguen, J., Thatcher, J., Wagner, E.: Abstract Data Types as Initial Algebras and Correctness of Data Representations, Current Trends in Programming Methodology, Vol. 4 (R. Yeh, ed.), Prentice Hall, N.Y., 1978, pp. 80–149.Google Scholar
  3. [AN75]
    Andreka,H. and Nemeti,I.: Generalisation of variety and quasivariety concepts to partial algebras through category theory, Dissertationes Mathematicae (Rozprawy Math.) 204 (1982)Google Scholar
  4. [BBTW81]
    Bergstra, J.A., Broy, M., Tucker, J.W., Wirsing, M.: On the Power of Algebraic Specifications, Proceedings of the MFCS'81, Springer Lecture Notes 118 (1981)Google Scholar
  5. [BF83]
    Barwise,J. and Feferman,S.; Higher Model Theory: Logic of Mathematical Concepts, Springer 1983Google Scholar
  6. [BG80]
    Burstall, R.M., Goguen, J.A.; The Semantics of CLEAR, a Specification Language, Proc. of 1979 Copenhagen Winter School on Abstract Software Specifications.Google Scholar
  7. [BG8?]
    Burstall, R.M., Goguen, J.A.; Institutions: Abstract model theory for program specification, unpublished draft, Stanford 1983.Google Scholar
  8. [BH76]
    Banaschewski, B. and Herrlich, H.; Subcategories defined by implications, Houston Journal of Mathematics 2.2 (1976) pp. 149–171Google Scholar
  9. [Cu68]
    Cudnovskii, G.V.; Some results in the theroy of infinitely long expressions, Soviet Math.Dokl. 9 (1968) pp.556–559Google Scholar
  10. [CMPPV80]
    Carvalho,, Maibaum, T.S.E., Pequeno, T.H.C., Pereda, A.A. and Veloso, P.A.S.; A Model Theoretic Approach to the Theory of Abstract Data Types and Data Structures. Research Report CS-80-22, Waterloo, Ontario, 1980.Google Scholar
  11. [Eh81]
    Ehrig, H.; Algebraic Theory of Parametrized Specifications with Requirements, Proceedings of the CAAP'81, Springer-Lecture Notes, No.112 (1981)Google Scholar
  12. [EKADJ80]
    Ehrig, H., Kreowski, H.J., Thatcher, J.W., Wagner, E.G. and Wright, J.B.; Parametrized Data Types in Algebraic Specification Languages, Proceedings of the 7th ICALP'80, LNCS 85 pp. 157–168, Springer 1980Google Scholar
  13. [EKMP82]
    Ehrig, H., Kreowski, H.J., Mahr, B. and Padawitz, P.; Algebraic Implementation of Abstract Data Types, to appear in TCS, Fall '82.Google Scholar
  14. [Gr79]
    Gratzer, G.; Universal Algebra, 2nd ed., Springer 1979Google Scholar
  15. [Gu75]
    Guttag, J.V.; The Specification and Application to Programming of Abstract Data Types, TR. CSRG-59, Toronto, 1975.Google Scholar
  16. [HR81]
    Hornung, G. and Raulefs, P.: Initial and Terminal Algebra Semantics of Parametrized Abstract Data Type Specifications with Inequalities. Proceedings of the CAAP'81, LNCS No. 112, Springer 1981Google Scholar
  17. [K79]
    Kamin, S.: "Some Definitions for Algebraic Data Type Specifications", SIGPLAN Notices 14 (3), 1979.Google Scholar
  18. [Ka80]
    Kamin, S.; Final Data Type Specifications: A New Data Type Specification Method, Proc. of the 7th POPL-Conference, 1980.Google Scholar
  19. [LZ74]
    Liskov, B.H. and Zilles, Z.M.: Programming with Abstract Data Types, Proc. ACM Symp. on Very High Level Languages, SIGPLAN Notices, 9, 1974, pp. 50–9Google Scholar
  20. [Ma56]
    Mal'cev, A.I.: Quasiprimitive Classes of Abstract Algebras, in the Metamathematics of Algebraic Systems, Studies in Logic, Vol. 66. North-Holland, 1971, pp. 27–31.Google Scholar
  21. [Mak82]
    Makowsky,J.A.; Model theoretic issues in theoretical computer science, to appear in the proceedings of the "Logic Colloquium '82", Florence 1982Google Scholar
  22. [MM83]
    Mahr, B. and Makowsky, J.A.: An axiomatic approach to semantics of specification languages, in "Theoretical Computer Science", 6th GI-Conference, Dortmund 1983, Lecture Notes in Computer Science vol. 145, pp. 211–219, Heidelberg 1983Google Scholar
  23. [Se72]
    Selman, A.: Completeness of Calculii for Axiomatically Defined Classes of Algebras, Algebra Universalis, Vol.2, Fasc. 1, 1972, pp. 20–32.Google Scholar
  24. [Wa78]
    Wand,M.: Final Algebra Semantics and Data Type Extensions, Indiana TR65 (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • B. Mahr
    • 1
  • J. A. Makowsky
    • 2
  1. 1.Computer Science DepartmentThe Pennsylvania State UniversityUniversity ParkUSA
  2. 2.Department of Computer ScienceTechnion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations