Skip to main content

On the style of mechanical proving

  • Conference paper
  • First Online:

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

Abstract

It is quite surprising that — after 5 years of experience — there has been still very little written about how to present and construct mechanical proofs. Such guidelines would definitely help a novice. Since mechanical proving is very different from proving on paper, it may take a long time before one gets accustomed to it and develops an efficient style for constructing and presenting such proofs. Traditional styles, like e.g. decomposing a problem into lemmas and incorporating hints to make the logic of a proof visible, are not straightforwardly taken over to the HOL world. In this paper we present two extensions to HOL, the DERIVATION and LEMMA packages, by which proofs can be written in very much the same format as one would on paper. They are not intended as a replacement of existing HOL mechanisms, but rather as an extension for enabling work in a higher level proof environment.

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. Cambridge University. The HOL System Tutorial, 1991. source included in the standard HOL package.

    Google Scholar 

  2. K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.

    Google Scholar 

  3. J.T. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht University, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Prasetya, I.S.W.B. (1994). On the style of mechanical proving. 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_157

Download citation

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

  • 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