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, in
[Lecture Notes in Computer Science] Theorem Proving in Higher Order Logics Volume 2152 || A Higher-Order Calculus for Categories
β Scribed by Boulton, Richard J.; Jackson, Paul B.
- Publisher
- Springer Berlin Heidelberg
- Year
- 2001
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<span>This book contains the proceedings of the 12th International Conference on TheoremProvinginHigherOrderLogics(TPHOLs'99), whichwasheldinNice at the University of Nice-Sophia Antipolis, September 14{17, 1999. Thirty- ve papers were submitted as completed research, and each of them was refereed b
<p><span>This book contains the refereed proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2007, held in Kaiserslautern, Germany, September 2007. Among the topics of this volume are formal semantics of specification, modeling, and programming language
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
<span>This volume is the proceedings of the 13th International Conference on TheoΒ rem Proving in Higher Order Logics (TPHOLs 2000) held 14-18 August 2000 in Portland, Oregon, USA. Each of the 55 papers submitted in the full reseΒ arch category was refereed by at least three reviewers who were selec