Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Standard model semantics for DSL a data type specification language

  • 30 Accesses

  • 1 Citations

Summary

We discuss a data type specification language DSL() which is obtained from the first order language L() for a given signature by augmenting it with schemes.

A specification is a pair (, \(\mathbb{F}\)) with \(\mathbb{F}\) a finite set of axioms in DSL(). As semantics of such specifications we propose: standard model semantics, SMS.

We investigate DSL/SMS as a specification mechanism for data types and compare it with both first order and algebraic specifications. A concise theory of parametrized data types is developed in this context.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Bergstra, J.A., Klop, J.W.: A formalized proof system for total correctness of while programs. In: The proceedings of ISI Conf., SLNCS 137, 1982

  2. 2.

    Bergstra, J.A., Klop, J.W.: Proving program inclusion using Hoare's Logic. Mathematical Centre Department of Computer Science Research Report 1W 176. Amsterdam, 1981

  3. 3.

    Bergstra, J.A., Terlouw, J.: A characterization of program equivalence in terms of Hoare's Logic. In: Springer LNCS 123, 1981

  4. 4.

    Bergstra, J.A., Tucker, J.V.: The completeness of the algebra specification methods for data-types. Mathematical Centre Department of Computer Science Research Report IW 165 Amsterdam, 1981

  5. 5.

    Enrich, H.-D.: On the theory of specification, implementation and parametrization of abstract datatypes. Research report Dortmund, 1978

  6. 6.

    Ehrig, H.E., Kreowski, H.-J., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Parametrized data-types in algebraic specification languages. Proc. 7th. ICALP SLNCS 85, 1980

  7. 7.

    Ganzinger, H.: Parametrized specifications: parameter passing and optimizing implementation. Report TUM-18110, Technische Universität München, August 1981

  8. 8.

    Goguen, J.A., Thatcher, J.W., Wright, J.B.: Abstract datatypes as initial algebras and correctness of data representations. In: Proceedings of ACM Conference on Computer Graphics. Pattern Recognition and Data Structure. ACM, New York, 1975

  9. 9.

    Guttag, J.V.: The specification and application to programming of abstract datatypes. Ph.D. Thesis. University of Toronto. Department of Computer Science. 1975

  10. 10.

    Kamin, S.: Final datatype specifications: a new datatype specification method. Proc. 7th ACM Symp. Principles Progr. Lang., Las Vegas, 1980

  11. 11.

    Kaphengst, H., Reichel, H.: Algebraische Algorithmentheorie. VEB Robotron, Dresden WIB. 1971

  12. 12.

    Thatcher, J.W., Wagner, E.G., Wright, J.B.: Datatype specification: parametrization and the power of specification techniques. Proc. SIGACT 10th. Annual STOC, 1978

  13. 13.

    Wand, M.: Final algebra semantics and datatype extensions. JCSS 19, 27–44 (1979)

  14. 14.

    Wirsing, M.: An analysis of semantic models for algebraic specifications. Lecture Notes for the International Summer School on theoretical foundations of programming methodology. München 1981

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bergstra, J.A., Terlouw, J. Standard model semantics for DSL a data type specification language. Acta Informatica 19, 97–113 (1983). https://doi.org/10.1007/BF00263930

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory