| 
10163
 | 
     1  | 
<html>
  | 
| 
 | 
     2  | 
  | 
| 
2080
 | 
     3  | 
<!-- $Id$ -->
  | 
| 
1339
 | 
     4  | 
  | 
| 
10163
 | 
     5  | 
<head><title>HOL/README</title></head>
  | 
| 
1339
 | 
     6  | 
  | 
| 
10163
 | 
     7  | 
<body>
  | 
| 
 | 
     8  | 
  | 
| 
 | 
     9  | 
<h2>HOL: Higher-Order Logic</h2>
  | 
| 
1339
 | 
    10  | 
  | 
| 
10262
 | 
    11  | 
These are the main sources of the Isabelle system for Higher-Order Logic.
  | 
| 
10163
 | 
    12  | 
  | 
| 
 | 
    13  | 
<p>
  | 
| 
2080
 | 
    14  | 
  | 
| 
10163
 | 
    15  | 
There are also several example sessions:
  | 
| 
 | 
    16  | 
<dl>
  | 
| 
2080
 | 
    17  | 
  | 
| 
10163
 | 
    18  | 
<dt>Algebra
  | 
| 
 | 
    19  | 
<dd>rings and univariate polynomials
  | 
| 
 | 
    20  | 
  | 
| 
 | 
    21  | 
<dt>Auth
  | 
| 
 | 
    22  | 
<dd>a new approach to verifying authentication protocols
  | 
| 
7303
 | 
    23  | 
  | 
| 
10163
 | 
    24  | 
<dt>AxClasses
  | 
| 
 | 
    25  | 
<dd>a few basic examples of using axiomatic type classes
  | 
| 
 | 
    26  | 
  | 
| 
 | 
    27  | 
<dt>BCV
  | 
| 
 | 
    28  | 
<dd>generic model of bytecode verification, i.e. data-flow analysis
  | 
| 
 | 
    29  | 
for assembly languages with subtypes
  | 
| 
7303
 | 
    30  | 
  | 
| 
14024
 | 
    31  | 
<dt>HOL-Complex
  | 
| 
 | 
    32  | 
<dd>a development of the complex numbers, the reals, and the hyper-reals,
  | 
| 
 | 
    33  | 
which are used in non-standard analysis (builds the image HOL-Complex)
  | 
| 
7303
 | 
    34  | 
  | 
| 
14024
 | 
    35  | 
<dt>HOL-Complex-HahnBanach
  | 
| 
10163
 | 
    36  | 
<dd>the Hahn-Banach theorem for real vector spaces (in Isabelle/Isar)
  | 
| 
7303
 | 
    37  | 
  | 
| 
14024
 | 
    38  | 
<dt>HOL-Complex-ex
  | 
| 
 | 
    39  | 
<dd>miscellaneous real ans complex number examples
  | 
| 
10163
 | 
    40  | 
  | 
| 
 | 
    41  | 
<dt>Hoare
  | 
| 
 | 
    42  | 
<dd>verification of imperative programs (verification conditions are
  | 
| 
 | 
    43  | 
generated automatically from pre/post conditions and loop invariants)
  | 
| 
7691
 | 
    44  | 
  | 
| 
10163
 | 
    45  | 
<dt>IMP
  | 
| 
 | 
    46  | 
<dd>mechanization of a large part of a semantics text by Glynn Winskel
  | 
| 
7291
 | 
    47  | 
  | 
| 
10163
 | 
    48  | 
<dt>IMPP
  | 
| 
 | 
    49  | 
<dd>extension of IMP with local variables and mutually recursive
  | 
| 
 | 
    50  | 
procedures
  | 
| 
2080
 | 
    51  | 
  | 
| 
10163
 | 
    52  | 
<dt>IOA
  | 
| 
 | 
    53  | 
<dd>a simple theory of Input/Output Automata
  | 
| 
 | 
    54  | 
  | 
| 
 | 
    55  | 
<dt>Induct
  | 
| 
 | 
    56  | 
<dd>examples of (co)inductive definitions
  | 
| 
3125
 | 
    57  | 
  | 
| 
10163
 | 
    58  | 
<dt>Isar_examples
  | 
| 
 | 
    59  | 
<dd>several introductory examples using Isabelle/Isar
  | 
| 
2080
 | 
    60  | 
  | 
| 
10163
 | 
    61  | 
<dt>Lambda
  | 
| 
 | 
    62  | 
<dd>fundamental properties of lambda-calculus (Church-Rosser and termination)
  | 
| 
2080
 | 
    63  | 
  | 
| 
10163
 | 
    64  | 
<dt>Lattice
  | 
| 
 | 
    65  | 
<dd>lattices and order structures (in Isabelle/Isar)
  | 
| 
7303
 | 
    66  | 
  | 
| 
10163
 | 
    67  | 
<dt>MicroJava
  | 
| 
 | 
    68  | 
<dd>formalization of a fragment of Java, together with a corresponding
  | 
| 
 | 
    69  | 
virtual machine and a specification of its bytecode verifier and a
  | 
| 
 | 
    70  | 
lightweight bytecode verifier, including proofs of type-safety.
  | 
| 
7291
 | 
    71  | 
  | 
| 
10163
 | 
    72  | 
<dt>Modelcheck
  | 
| 
 | 
    73  | 
<dd>basic setup for integration of some model checkers in Isabelle/HOL
  | 
| 
7290
 | 
    74  | 
  | 
| 
10163
 | 
    75  | 
<dt>NumberTheory
  | 
| 
 | 
    76  | 
<dd>fundamental Theorem of Arithmetic, Chinese Remainder Theorem,
  | 
| 
 | 
    77  | 
Fermat/Euler Theorem, Wilson's Theorem
  | 
| 
7662
 | 
    78  | 
  | 
| 
10163
 | 
    79  | 
<dt>Prolog
  | 
| 
 | 
    80  | 
<dd>a (bare-bones) implementation of Lambda-Prolog
  | 
| 
 | 
    81  | 
  | 
| 
 | 
    82  | 
<dt>Subst
  | 
| 
 | 
    83  | 
<dd>defines a theory of substitution and unification.
  | 
| 
7290
 | 
    84  | 
  | 
| 
10163
 | 
    85  | 
<dt>TLA
  | 
| 
 | 
    86  | 
<dd>Lamport's Temporal Logic of Actions (with separate example sessions)
  | 
| 
7291
 | 
    87  | 
  | 
| 
10163
 | 
    88  | 
<dt>UNITY
  | 
| 
 | 
    89  | 
<dd>Chandy and Misra's UNITY formalism
  | 
| 
7290
 | 
    90  | 
  | 
| 
10163
 | 
    91  | 
<dt>W0
  | 
| 
 | 
    92  | 
<dd>a precursor of MiniML, without let-expressions
  | 
| 
7291
 | 
    93  | 
  | 
| 
10163
 | 
    94  | 
<dt>ex
  | 
| 
 | 
    95  | 
<dd>miscellaneous examples
  | 
| 
 | 
    96  | 
  | 
| 
 | 
    97  | 
</dl>
  | 
| 
1339
 | 
    98  | 
  | 
| 
 | 
    99  | 
Useful references on Higher-Order Logic:
  | 
| 
 | 
   100  | 
  | 
| 
10163
 | 
   101  | 
<ul>
  | 
| 
1339
 | 
   102  | 
  | 
| 
10163
 | 
   103  | 
<li>P. B. Andrews,<br>
  | 
| 
 | 
   104  | 
An Introduction to Mathematical Logic and Type Theory<br>
  | 
| 
 | 
   105  | 
(Academic Press, 1986).
  | 
| 
4622
 | 
   106  | 
  | 
| 
10163
 | 
   107  | 
<li>A. Church,<br>
  | 
| 
 | 
   108  | 
A Formulation of the Simple Theory of Types<br>
  | 
| 
 | 
   109  | 
(Journal of Symbolic Logic, 1940).
  | 
| 
4622
 | 
   110  | 
  | 
| 
10163
 | 
   111  | 
<li>M. J. C. Gordon and T. F. Melham (editors),<br>
  | 
| 
 | 
   112  | 
Introduction to HOL: A theorem proving environment for higher order logic<br>
  | 
| 
 | 
   113  | 
(Cambridge University Press, 1993).
  | 
| 
4622
 | 
   114  | 
  | 
| 
10163
 | 
   115  | 
<li>J. Lambek and P. J. Scott,<br>
  | 
| 
 | 
   116  | 
Introduction to Higher Order Categorical Logic<br>
  | 
| 
 | 
   117  | 
(Cambridge University Press, 1986).
  | 
| 
4622
 | 
   118  | 
  | 
| 
10163
 | 
   119  | 
</ul>
  | 
| 
1339
 | 
   120  | 
  | 
| 
10163
 | 
   121  | 
</body>
  | 
| 
 | 
   122  | 
</html>
  |