Skip to main content

An ASM Dynamic Semantics for Standard ML

  • Conference paper
  • First Online:
Abstract State Machines - Theory and Applications (ASM 2000)

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

Included in the following conference series:

  • 414 Accesses

Abstract

The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the functional programming language Standard ML. We give an operational semantics for Standard ML by means of an interpreter for (appropriately pre-processed) Standard ML programs; the effect of a Standard ML instruction can be seen in terms of the corresponding actions performed by the ASM.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Anlauff, P. Kutter, and A. Pierantonio. Formal Aspects of and Development Environments for Montages. In M. Sellink, editor, 2nd International Workshop on the Theory and Practice of Algebraic Specifications, Workshops in Computing, Amsterdam, 1997. Springer.

    Google Scholar 

  2. E. Börger, U. Glässer, and W. Müller. The Semantics of Behavioral VHDL’93 Descriptions. In EURO-DAC’94. European Design Automation Conference with EURO-VHDL’94, pages 500–505, Los Alamitos, California, 1994. IEEE CS Press.

    Google Scholar 

  3. E. Börger and J. Huggins. Abstract State Machines 1988-1998: Commented ASM Bibliography. Bulletin of EATCS,64:105–127, February 1998. (An updated versionis available from [15].).

    Google Scholar 

  4. E. Börger and D. Rosenzweig. A Mathematical Definition of Full Prolog. In Science of Computer Programming, volume 24, pages 249–286. North-Holland, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  5. E. Börger and W. Schulte. Programmer Friendly Modular Definition of the Semantics of Java. In J. Alves-Foss, editor, Formal Syntax and Semantics of Java, LNCS. Springer, 1998.

    Google Scholar 

  6. S. Cater and J. Huggins. An ASM Dynamic Semantics for Standard ML. Technical Report CPSC-1999-2, Kettering University, 1999.

    Google Scholar 

  7. U. Glässer. Abstract State Machines Europe Home Page. http://www.uni-paderborn.de/cs/asm/.

  8. Y. Gurevich. Reconsidering Turing’s Thesis: Toward More Realistic Semantics of Programs. Technical Report CRL-TR-38-84, EECS Department, University of Michigan, 1984.

    Google Scholar 

  9. Y. Gurevich. Logic and the Challenge of Computer Science. In E. Börger, editor, Current Trends in Theoretical Computer Science, pages 1–57. Computer Science Press, 1988.

    Google Scholar 

  10. Y. Gurevich. Evolving Algebras. A Tutorial Introduction. Bulletin of EATCS, 43:264–284, 1991. (Reprinted in G. Rozenberg and A. Salomaa, eds., Current Trends in Theoretical Computer Science, World Scientific, 1993, 266-292.).

    Google Scholar 

  11. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.

    Google Scholar 

  12. Y. Gurevich. Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic, page to appear, 2000.

    Google Scholar 

  13. Y. Gurevich and J. Huggins. The Semantics of the C Programming Language. In E. Börger, H. Kleine Büning, G. Jäger, S. Martini, and M. M. Richter, editors, Computer Science Logic, volume 702 of LNCS, pages 274–309. Springer, 1993.

    Chapter  Google Scholar 

  14. Robert Harper and Chris Stone. A type-theoretic interpretation of Standard ML. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Robin Milner Festschrifft. MIT Press, 1998.

    Google Scholar 

  15. J. Huggins. Abstract State Machines Home Page. http://www.eecs.umich.edu/gasm/.

  16. P.W. Kutter and A. Pierantonio. Montages: Specifications of Realistic Programming Languages. Journal of Universal Computer Science, 3(5):416–442, 1997.

    MathSciNet  MATH  Google Scholar 

  17. P.W. Kutter and A. Pierantonio. The Formal Specification of Oberon. Journal of Universal Computer Science, 3(5):443–503, 1997.

    MATH  Google Scholar 

  18. Lucent Technology. Standard ML of New Jersey Home Page. http://cm.bell-labs.com/cm/cs/what/smlnj/.

  19. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.

    Google Scholar 

  20. C. Wallace. The Semantics of the C++ Programming Language. In E. Börger, editor, Specification and Validation Methods, pages 131–164. Oxford University Press, 1995.

    Google Scholar 

  21. C. Wallace. The Semantics of the Java Programming Language: Preliminary Version. Technical Report CSE-TR-355-97, EECS Dept., University of Michigan, December 1997.

    Google Scholar 

  22. D. Watt. The Static and Dynamic Semantics of Standard ML. In Proceedings of the Second International Workshop on Action Semantics (AS’99), number NS-99-3 in BRICS Notes Series, pages 155–172. Department of Computer Science, University of Aarhus, May 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cater, S.C., Huggins, J.K. (2000). An ASM Dynamic Semantics for Standard ML. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44518-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67959-2

  • Online ISBN: 978-3-540-44518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics