A categorical concept of constraints for algebraic specifications

  • Hartmut Ehrig
Part 1: Fundamental Categorical Methods In Computer Science
Part of the Lecture Notes in Computer Science book series (LNCS, volume 393)


An abstract notion of constraints for algebraic specifications is introduced which includes initial, generating, free generating, term generating and first order logical constraints. On the semantical level we study the category CATSPECC of algebraic specifications with constraints and on the semantical level the category Cat(SPECC) of SPECC-algebras, which are usual SPEC-algebras satisfying a given set C of constraints.

We show that basic constructions — including the amalgamation and extension lemma — in the case without constraints can be extended to the case with constraints and applied to parameterized specifications and actualization with constraints. The main result shows that actualization in the case of arbitrary constraints is correctness preserving and compositional.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BG 80]
    Burstall, R.M.; Goguen, J.A.: Semantics of CLEAR, a specification language. Abstract Software Specifications, D. BjØrner (ed); Proc. 1979 Copenhagen Winter School, Springer Lecture Notes in Computer Science 86, 1980, 292–332Google Scholar
  2. [CIP 81]
    CIP Language Group: Report on a Wide Spectrum Language for Program Specification and Development, Techn. Report TUM-I8104, TU München, 1981Google Scholar
  3. [Ehg 81]
    Ehrig, H.: Algebraic theory of parameterized specifications with requirements. 6e Coll. Les Arbres en Algebre et Programmation, Genova 1981, Springer LNCS 112, 1–24Google Scholar
  4. [EM 85]
    Ehrig, H.; Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, EATCS Monographs on Theoretical Computer Science, Vol 6, Springer-Verlag Berlin Heidelberg New York Tokyo, 1985Google Scholar
  5. [EM 89]
    Ehrig, H.; Mahr, B.: Fundamentals of Algebraic Specification 2, to appear 1989Google Scholar
  6. [EWT 83]
    Ehrig, H.; Wagner, E.G.; Thatcher, J.W.: Algebraic specifications with generating constraints. 10th Int. Coll. Automata, Languages, and Programming (1983), BarcelonaGoogle Scholar
  7. [GB 84]
    Goguen, J.A.; Burstall, R.M.: Institutions: Abstract Model Theory for Computer Science, Proc. Logics of Programming Workshop, LNCS 164 (1984)Google Scholar
  8. [GTW 76]
    Goguen, J.A.; Thatcher, J.W.; Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. IBM Research Report RC 6487, 1976. Also: Current Trends in Programming Methodology IV: Data Structuring (R. Yeh, ed.), Prentice Hall (1978), 80–144Google Scholar
  9. [HKR 80]
    Hupbach, U.L.; Kaphengst, H.; Reichel, H.: Initial algebraic specification of data types, parameterized data types and algorithms. VEB Robotron ZFT, Techn. Report 15, Dresden 1980Google Scholar
  10. [PB al 82]
    Pepper, P.; Broy, M.; Bauer, F.L.; Partsch, H.; Dosch, W.; Wirsing, M.: Abstrakte Datentypen: Die abstrakte Spezifikation von Rechenstrukturen. Informatik-Spektrum 5 (1982), 107–119Google Scholar
  11. [Rei 80]
    Reichel, H.: Initially Restricting Algebraic Theories, Proc. MFCS'80, LNCS 88 (1980), p. 291Google Scholar
  12. [WE 87]
    Wagner, E.G.; Ehrig, H.: Canonical Constraints for Parameterized Data Types, TCS 50 (1987), 323–349Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Hartmut Ehrig
    • 1
  1. 1.Technical University of BerlinGermany

Personalised recommendations