On observational equivalence and algebraic specification

Extended abstract
  • Donald Sannella
  • Andrzej Tarlecki
Colloquium On Trees In Algebra And Programming Specifications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)


The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specification-building operation (observational abstraction) are studied. We begin with a definition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised to make sense under an arbitrary institution. Behavioural equivalence is treated as an important special case of observational equivalence, and its central role in program development is shown by means of an example.


Abstract Data Type Signature Morphism Algebraic Specification Springer LNCS Infinitary Logic 
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.

7 References

  1. [ADJ 76]
    Goguen, J.A., Thatcher, J.W. and Wagner, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types. IBM research report RC 6487. Also in: Current Trends in Programming Methodology, Vol. 4: Data Structuring (R.T. Yeh, ed.), Prentice-Hall, pp. 80–149 (1978).Google Scholar
  2. [Bar 73]
    Barwise, J. Back and forth through infinitary logic. In: Studies in Mathematics, Vol. 8: Studies in Model Theory (M.D. Morley, ed.), Mathematical Assoc. of America, pp. 5–34.Google Scholar
  3. [Bar 74]
    Barwise, J. Axioms for abstract model theory. Annals of Math. Logic 7, pp. 221–265.Google Scholar
  4. [Bau 81]
    Bauer, F.L. et al (the CIP Language Group) Report on a wide spectrum language for program specification and development (tentative version). Report TUM-I8104, Technische Univ. München.Google Scholar
  5. [BG 80]
    Burstall, R.M. and Goguen, J.A. The semantics of Clear, a specification language. Proc. of Advanced Course on Abstract Software Specifications, Copenhagen. Springer LNCS 86, pp. 292–332.Google Scholar
  6. [BG 82]
    Burstall, R.M. and Goguen, J.A. Algebras, theories and freeness: an introduction for computer scientists. Proc. 1981 Marktoberdorf NATO Summer School, Reidel.Google Scholar
  7. [BMS 80]
    Burstall, R.M., MacQueen, D.B. and Sannella, D.T. HOPE: an experimental applicative language. Proc. 1980 LISP Conference, Stanford, California, pp. 136–143.Google Scholar
  8. [Chu 36]
    Church, A. An unsolvable problem of elementary number theory. American Journal of Mathematics 58, pp. 345–363.Google Scholar
  9. [Ehr 79]
    Ehrich, H.-D. On the theory of specification, implementation, and parametrization of abstract data types. Report 82, Abteilung Informatik, Univ. of Dortmund. Also in: JACM 29, 1, pp. 206–227 (1982).CrossRefGoogle Scholar
  10. [Ehrig 84]
    Ehrig, H. An algebraic specification concept for modules (draft version). Report 84-04, Institut für Software und Theoretische Informatik, Technische Univ. Berlin.Google Scholar
  11. [EKMP 82]
    Ehrig, H., Kreowski, H.-J., Mahr, B. and Padawitz, P. Algebraic implementation of abstract data types. Theoretical Computer Science 20, pp. 209–263.Google Scholar
  12. [ETLZ 82]
    Ehrig, H., Thatcher, J.W., Lucas, P. and Zilles, S.N. Denotational and initial algebra semantics of the algebraic specification language LOOK. Draft report, IBM research.Google Scholar
  13. [EWT 83]
    Ehrig, H., Wagner, E.G. and Thatcher, J.W. Algebraic specifications with generating constraints. Proc. 10th ICALP, Barcelona. Springer LNCS 154, pp. 188–202.Google Scholar
  14. [End 72]
    Enderton, H.B. A Mathematical Introduction to Logic. Academic Press.Google Scholar
  15. [GGM 76]
    Giarratana, V., Gimona, F. and Montanari, U. Observability concepts in abstract data type specification. Proc. 5th MFCS, Gdansk. Springer LNCS 45.Google Scholar
  16. [GB 80]
    Goguen, J.A. and Burstall, R.M. CAT, a system for the structured elaboration of correct programs from structured specifications. Technical report CSL-118, Computer Science Laboratory, SRI International.Google Scholar
  17. [GB 83]
    Goguen, J.A. and Burstall, R.M. Introducing institutions. Proc. Logics of Programming Workshop, Carnegie-Mellon. Springer LNCS 164, pp. 221–256.Google Scholar
  18. [GM 81]
    Goguen, J.A. and Meseguer, J. Completeness of many-sorted equational logic. SIGPLAN Notices 16(7), pp. 24–32; extended version to appear in Houston Journal of Mathematics.Google Scholar
  19. [GM 82]
    Goguen, J.A. and Meseguer, J. Universal realization, persistent interconnection and implementation of abstract modules. Proc. 9th ICALP, Aarhus, Denmark. Springer LNCS 140, pp. 265–281.Google Scholar
  20. [GM 83]
    Goguen, J.A. and Meseguer, J. An initiality primer. Draft report, SRI International.Google Scholar
  21. [GH 80]
    Guttag, J.V. and Horning, J.J. Formal specification as a design tool. Proc. ACM Symposium on Principles of Programming Languages, Las Vegas, pp. 251–261.Google Scholar
  22. [Kam 83]
    Kamin, S. Final data types and their specification. TOPLAS 5, 1, pp. 97–121.Google Scholar
  23. [Karp 64]
    Karp, C.R. Languages with Expressions of Infinite Length. North-Holland.Google Scholar
  24. [LB 77]
    Liskov, B.H. and Berzins, V. An appraisal of program specifications. Computation Structures Group memo 141-1, Laboratory for Computer Science, MIT.Google Scholar
  25. [MSV 83]
    Maibaum, T.S.E., Sadler, M.R. and Veloso, P.A.S. Logical implementation. Technical report, Department of Computing, Imperial College.Google Scholar
  26. [Pep 83]
    Pepper, P. On the correctness of type transformations. Talk at 2nd Workshop on Theory and Applications of Abstract Data Types, Passau.Google Scholar
  27. [Rei 81]
    Reichel, H. Behavioural equivalence — a unifying concept for initial and final specification methods. Proc. 3rd Hungarian Computer Science Conf., Budapest, pp. 27–39.Google Scholar
  28. [SB 83]
    Sannella, D.T. and Burstall, R.M. Structured theories in LCF. Proc. 8th Colloq. on Trees in Algebra and Programming, L'Aquila, Italy. Springer LNCS 159, pp. 377–391.Google Scholar
  29. [ST 84]
    Sannella, D.T. and Tarlecki, A. Building specifications in an arbitrary institution. Proc. Intl. Symposium on Semantics of Data Types, Sophia-Antipolis. Springer LNCS 173, pp. 337–356.Google Scholar
  30. [ST 85]
    Sannella, D.T. and Tarlecki, A. Program specification and development in Standard ML. Proc. 12th ACM Symp. on Principles of Programming Languages, New Orleans.Google Scholar
  31. [SW 82]
    Sannella, D.T. and Wirsing, M. Implementation of parameterised specifications. Report CSR-103-82, Dept. of Computer Science, Univ. of Edinburgh; extended abstract in: Proc. 9th ICALP, Aarhus, Denmark. Springer LNCS 140, pp. 473–488.Google Scholar
  32. [SW 83]
    Sannella, D.T. and Wirsing, M. A kernel language for algebraic specification and implementation. Report CSR-131-83, Dept. of Computer Science, Univ. of Edinburgh; extended abstract in: Proc. Intl. Conf. on Foundations of Computation Theory, Borgholm, Sweden. Springer LNCS 158, pp. 413–427.Google Scholar
  33. [Sch 83]
    Schoett, O. A theory of program modules, their specification and implementation (extended abstract). Report CSR-155-83, Dept. of Computer Science, Univ. of Edinburgh.Google Scholar
  34. [Scott 65]
    Scott, D. Logic with denumerably long formulas and finite strings of quantifiers. In: Theory of Models. North-Holland, pp. 329–341.Google Scholar
  35. [Tar 84]
    Tarlecki, A. Free constructions in abstract algebraic institutions. Draft report, Dept. of Computer Science, Univ. of Edinburgh.Google Scholar
  36. [Wand 79]
    Wand, M. Final algebra semantics and data type extensions. JCSS 19, pp. 27–44.Google Scholar
  37. [Wir 82]
    Wirsing, M. Structured algebraic specifications. Proc. AFCET Symp. on Mathematics for Computer Science, Paris, pp. 93–107.Google Scholar
  38. [Wir 83]
    Wirsing, M. Structured algebraic specifications: a kernel language. Habilitation thesis, Technische Univ. München.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Donald Sannella
    • 1
  • Andrzej Tarlecki
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghUK

Personalised recommendations