Introduction to HOL: A theorem-proving environment for higher order logic

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Gordon M.J. C., Melham T.F. (eds.)
Publisher: Cambridge University Press
Year: 1993

Language: English
Pages: 472
Tags: Lógica simbólica -- matemática.;Lógica simbólica y matemática.;Automatic theorem proving.;Logic, Symbolic And Mathematical.;ML (Computer Program Language);ML (Lenguaje de programación);Teoremas-Demostración automática.

Content: Part I. Tutorial: 1. Introduction to ML
2. The HOL logic
3. Introduction to proof with HOL
4. Goal-oriented proof: tactics and tacticals
5. Example: a simple parity checker
6. How to program a proof tool
7. Example: the binomial theorem
Part II. The Meta-Language ML: 8. The history of ML
9. Introduction and examples
10. Syntax of ML
11. Semantics of ML
12. ML types
13. Primitive ML identifier bindings
14. General purpose and list processing functions
15. ML system functions
Part III. The Hol Logic: 16. Syntax and semantics
17. Theories
Part IV. The Hol System: 18. The HOL logic in ML
Part V. Theorem-Proving With HOL: 19. Derived inference rules
20. Conversions
21. Goal-directed proof: tactics and tacticals
Appendices.