Introduction to HOL: A Theorem-Proving Environment for Higher-Order Logic
β Scribed by M. J. C. Gordon, T. F. Melham
- Publisher
- Cambridge University Press
- Year
- 1993
- Tongue
- English
- Leaves
- 493
- Edition
- Spi
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
HOL is a proof development system intended for applications to both hardware and software. It is principally used in two ways: for directly proving theorems, and as theorem-proving support for application-specific verification systems. HOL is currently being applied to a wide variety of problems, including the specification and verification of critical systems. Introduction to HOL provides a coherent and self-contained description of HOL containing both a tutorial introduction and most of the material that is needed for day-to-day work with the system. After a quick overview that gives a 'hands-on feel' for the way HOL is used, there follows a detailed description of the ML language. The logic that HOL supports and how this logic is embedded in ML are then described in detail. This is followed by an explanation of the theorem-proving infrastructure provided by HOL. Finally two appendices contain a subset of the reference manual, and an overview of the HOL library, including an example of an actual library documentation.
π SIMILAR VOLUMES
The HOL system is a higher order logic theorem proving system implemented at Edinburgh University, Cambridge University and INRIA. Its many applications, from the verification of hardware designs at all levels to the verification of programs and communication protocols are considered in depth in thi
<p><span>This is the first comprehensive textbook on higher-order logic that is written specifically to introduce the subject matter to graduate students in philosophy. The book covers both the formal aspects of higher-order languagesβtheir model theory and proof theory, the theory of Ξ»-abstraction
<p>This volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order log