Skip to main content

Graphical Theories of Interactive Systems: Can a Proof Assistant Help?

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2000)

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

Included in the following conference series:

  • 428 Accesses

Abstract

Computer scientists are privileged, or doomed, to deal rigorously with large structures. This happens, of course, with hardware design and verification, and with programs and specifications. Considerable progress has been made with mechanised proof assistance for both. Going further into the back room, programming languages are also big structures. It’s very uncommon to have help from a proof assistant while actually designing a language, probably because the very formalism for writing down what a language means is changing under our feet, so it’s asking too much for those who build proof assistants to keep up with these developments enough to help the designers in real time. All the same, it has been encouraging to see plenty of post hoc verification of properties of Standard ML using its semantic formalism. Perhaps a future language design using “big step structure operational semantics” could be done using proof assistance to check out the sanity of a large set of inference rules before they are frozen into a design.

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

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

Milner, R. (2000). Graphical Theories of Interactive Systems: Can a Proof Assistant Help?. In: Aagaard, M., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2000. Lecture Notes in Computer Science, vol 1869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44659-1_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-44659-1_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics