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