Skip to main content

A type model for VDM

  • Foundations I
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 252))

Abstract

A model of types for use in VDM specifications is presented. Standard VDM types consisting of finitary values are given set-theoretic denotations, restricting the use of Scott domain theory to the provision of types for the continuous functions and Bekic mappings. An objective of this work was to give a simple account of recursively defined data types not involving the full apparatus surrounding the use of Scott domain theory. To do this, various “type universes” are introduced axiomatically for use as semantic denotation spaces for type expressions. Basic constructions of these universes are given to show that these axiomatic requirements can be satisfied. As these type universes indirectly specify the “values” that each type consists of, it also gives a framework for building a full semantic model of VDM.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.Bjorner, C.B.Jones, Formal Specification and Software Development, Prentice Hall, 1982

    Google Scholar 

  2. A.Blikle, A metalanguage for Naive Denotational Semantics, Progetto Finalizzato Informatica, C.N.R. Progetto Pl CNET 104, Pisa, 1984.

    Google Scholar 

  3. P.M.Cohn, Universal Algebra, D.Reidel Pub. Co., 1980.

    Google Scholar 

  4. K.J.Devlin, Fundamentals of Contemporary Set Theory, Universitext, Springer-Verlag, 1979.

    Google Scholar 

  5. H.Enderton, Elements of Set Theory Academic Press, 1975

    Google Scholar 

  6. R. Goldblatt, Topoi: The Categorical Analysis of Logic, Studies in Logic, Vol 98, North Holland Pub. Co., Amsterdam, 1979

    Google Scholar 

  7. P.Halmos, Naive Set Theory, Springer-Verlag, 1979

    Google Scholar 

  8. C.B.Jones, Systematic Software Development using VDM, Prentice Hall, 1986

    Google Scholar 

  9. B.Q.Monahan, A type model for VDM, Internal technical report, STL Ltd/University of Manchester, July 1984

    Google Scholar 

  10. R. Milner, A theory of type polymorphism in programming, J.Computer and System Sciences, Vol 17, p348–375, 1978.

    Google Scholar 

  11. D.A.Schmidt, Denotational Semantics: A methodology for language development, Allyn and Bacon, 1986

    Google Scholar 

  12. D.S.Scott, Domains for Denotational Semantics, ICALP' 82, Aarhus, Denmark, July, 1982

    Google Scholar 

  13. J.E.Stoy, Denotational Semantics, The MIT Press, 1977

    Google Scholar 

  14. G.Winskel, K.G.Larsen, Using Information Systems to solve Recursive Domain Equations effectively Technical report 51, University of Cambridge Computer Laboratory, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dines Bjørner Cliff B. Jones Mícheál Mac an Airchinnigh Erich J. Neuhold

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monahan, B.Q. (1987). A type model for VDM. In: Bjørner, D., Jones, C.B., Mac an Airchinnigh, M., Neuhold, E.J. (eds) VDM '87 VDM — A Formal Method at Work. VDM 1987. Lecture Notes in Computer Science, vol 252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17654-3_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-17654-3_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17654-1

  • Online ISBN: 978-3-540-47740-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics