Skip to main content
SpringerLink
Log in

Reasoning with the formal definition of standard ML in HOL

  • Conference paper
  • First Online:
Higher Order Logic Theorem Proving and Its Applications (HUG 1993)

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

Included in the following conference series:

Abstract

This paper describes the results of a project to embed the Formal Definition of the Standard ML Core language into the HOL mechanized reasoning system. HOL theories of the Core syntax and dynamic semantics are presented, including a purely definitional representation of the semantic inference rules. The correctness of the representation is demonstrated by the derivation of several important language properties, including determinacy. A symbolic evaluator to assist in proving properties of Standard ML program fragments is also described. Some sample applications of the theory in the area of program verification are given.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robert S. Boyer and J Strother Moore. A Computational Logic. ACM Monograph Series. Academic Press, 1979.

    Google Scholar 

  2. A. Cant and M.A. Ozols. A verification environment for ML. In Proceedings of the ACM SIGPLAN Workshop on ML and its Applications, pages 151–155, June 1992.

    Google Scholar 

  3. Michael J. C. Gordon. Mechanizing programming languages in Higher Order Logic. HOL System Documentation, 1988.

    Google Scholar 

  4. Michael J. C. Gordon et al. The HOL System Description, December 1989.

    Google Scholar 

  5. Matthew Hutchins. Machine Assisted Reasoning About Standard ML Using HOL. Australian National University, 1990. Honours Thesis.

    Google Scholar 

  6. Tom Melham. A package for inductive relation definitions in HOL. Proceedings of the 1991 HOL Workshop, 1991.

    Google Scholar 

  7. Tom Melham. HOL-INFO mailing list archives, 1992.

    Google Scholar 

  8. Robin Milner. Lecture notes on language semantics. Computer Science 3, University of Edinburgh.

    Google Scholar 

  9. Robin Milner and Mads Tofte. Commentary on Standard ML. MIT Press, 1990.

    Google Scholar 

  10. Rachel Onate-Ruxos. Mutually recursive inductive relation definitions in HOL. HOL 1993 Workshop, 1993. Preprint of submitted paper.

    Google Scholar 

  11. Robin Milner Robert Harper and Mads Tofte. The Definition Of Standard ML, Version Z. MIT Press, 1990.

    Google Scholar 

  12. Claudio V. Russo. Automating Mutually Recursive Type Definitions in HOL. University Of Edinburgh, June 1992. Honours Thesis.

    Google Scholar 

  13. Donald Syme. Reasoning with the Formal Definition of Standard ML in HOL. Australian National University, 1992. Honours Thesis.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Australian National University, GPO Box 4, 2601, Canberra, Australia

    Donald Syme

  2. Division of Information Technology, CSIRO, GPO Box 664, 2601, Canberra, Australia

    Donald Syme

Authors
  1. Donald Syme
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jeffrey J. Joyce Carl-Johan H. Seger

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Syme, D. (1994). Reasoning with the formal definition of standard ML in HOL. In: Joyce, J.J., Seger, CJ.H. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1993. Lecture Notes in Computer Science, vol 780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57826-9_124

Download citation

  • DOI: https://doi.org/10.1007/3-540-57826-9_124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57826-0

  • Online ISBN: 978-3-540-48346-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation