src/HOL/README.html
author wenzelm
Fri Aug 20 15:41:19 1999 +0200 (1999-08-20)
changeset 7303 96bc013c8987
parent 7291 8aa66ddc0bea
child 7662 062a782d7402
permissions -rw-r--r--
AxClasses, Isar_examples;
paulson@2080
     1
<!-- $Id$ -->
wenzelm@3279
     2
<HTML><HEAD><TITLE>HOL/README</TITLE></HEAD><BODY>
clasohm@1339
     3
wenzelm@3279
     4
<H2>HOL: Higher-Order Logic</H2>
clasohm@1339
     5
wenzelm@3279
     6
This directory contains the ML sources of the Isabelle system for
wenzelm@3279
     7
Higher-Order Logic.<P>
clasohm@1339
     8
wenzelm@3279
     9
There are several subdirectories with examples:
paulson@2080
    10
<DL>
clasohm@1339
    11
<DT>ex
paulson@2080
    12
<DD>general examples
paulson@2080
    13
paulson@2080
    14
<DT>Auth
paulson@2080
    15
<DD>a new approach to verifying authentication protocols 
paulson@2080
    16
wenzelm@7303
    17
<DT>AxClasses
wenzelm@7303
    18
<DD>a few axiomatic type class examples:
wenzelm@7303
    19
<DL>
wenzelm@7303
    20
wenzelm@7303
    21
<DT> Tutorial <DD> Some simple axclass demos that go along with the
wenzelm@7303
    22
<em>axclass</em> Isabelle document (<tt>isatool doc axclass</tt>).
wenzelm@7303
    23
wenzelm@7303
    24
<DT> Group
wenzelm@7303
    25
<DD> Some bits of group theory.
wenzelm@7303
    26
wenzelm@7303
    27
<DT> Lattice
wenzelm@7303
    28
<DD> Basic theory of lattices and orders.
wenzelm@7303
    29
wenzelm@7303
    30
</DL>
wenzelm@7303
    31
nipkow@7291
    32
<DT>Hoare
nipkow@7291
    33
<DD>verification of imperative programs; verification conditions are
nipkow@7291
    34
generated automatically from pre/post conditions and loop invariants.
nipkow@7291
    35
paulson@2080
    36
<DT>IMP
paulson@2080
    37
<DD>mechanization of a large part of a semantics text by Glynn Winskel
paulson@2080
    38
paulson@3125
    39
<DT>Induct
paulson@3125
    40
<DD>examples of (co)inductive definitions
paulson@3125
    41
paulson@7290
    42
<DT>Integ 
paulson@7290
    43
<DD>a development of the integers including efficient integer
paulson@7290
    44
calculations (part of the standard HOL environment)
paulson@2080
    45
paulson@2080
    46
<DT>IOA
nipkow@7291
    47
<DD>a simple theory of Input/Output Automata
paulson@2080
    48
wenzelm@7303
    49
<DT>Isar_examples
wenzelm@7303
    50
<DD>some Isabelle/Isar proof documents
wenzelm@7303
    51
paulson@2080
    52
<DT>Lambda
paulson@2080
    53
<DD>a proof of the Church-Rosser theorem for lambda-calculus
clasohm@1339
    54
nipkow@7291
    55
<DT>Lex
nipkow@7291
    56
<DD>verification of a simple lexical analyzer generator
nipkow@7291
    57
nipkow@7291
    58
<DT>MiniML
nipkow@7291
    59
<DD>formalization of type inference for the language Mini-ML
nipkow@7291
    60
paulson@7290
    61
<DT>Real 
paulson@7290
    62
<DD>a development of the reals and hyper-reals, which are used in
paulson@7290
    63
non-standard analysis.  Also includes the positive rationals.  Used to build
paulson@7290
    64
the image HOL-Real.
paulson@7290
    65
clasohm@1339
    66
<DT>Subst
paulson@7290
    67
<DD>defines a theory of substitution and unification.
paulson@7290
    68
nipkow@7291
    69
<DT>TLA
nipkow@7291
    70
<DD>Lamport's Temporal Logic of Actions
nipkow@7291
    71
paulson@7290
    72
<DT>Tools
paulson@7290
    73
<DD>holds code used to provide support for records, datatypes, induction, etc.
paulson@7290
    74
paulson@7290
    75
<DT>UNITY
paulson@7290
    76
<DD>Chandy and Misra's UNITY formalism.
nipkow@7291
    77
nipkow@7291
    78
<DT>W0
nipkow@7291
    79
<DD>a precursor of MiniML, without let-expressions
clasohm@1339
    80
</DL>
clasohm@1339
    81
clasohm@1339
    82
Useful references on Higher-Order Logic:
clasohm@1339
    83
clasohm@1339
    84
<UL>
wenzelm@4622
    85
wenzelm@4622
    86
<LI> P. B. Andrews,<BR>
clasohm@1341
    87
    An Introduction to Mathematical Logic and Type Theory<BR>
clasohm@1341
    88
    (Academic Press, 1986).
clasohm@1339
    89
wenzelm@4622
    90
<P>
wenzelm@4622
    91
wenzelm@4622
    92
<LI> A. Church,<BR>
wenzelm@4622
    93
    A Formulation of the Simple Theory of Types<BR>
wenzelm@4622
    94
    (Journal of Symbolic Logic, 1940).
wenzelm@4622
    95
wenzelm@4622
    96
<P>
wenzelm@4622
    97
wenzelm@4622
    98
<LI> M. J. C. Gordon and T. F. Melham (editors),<BR>
wenzelm@4622
    99
    Introduction to HOL: A theorem proving environment for higher order logic<BR>
wenzelm@4622
   100
    (Cambridge University Press, 1993).
wenzelm@4622
   101
wenzelm@4622
   102
<P>
wenzelm@4622
   103
wenzelm@4622
   104
<LI> J. Lambek and P. J. Scott,<BR>
wenzelm@4622
   105
    Introduction to Higher Order Categorical Logic<BR>
wenzelm@4622
   106
    (Cambridge University Press, 1986).
wenzelm@4622
   107
clasohm@1339
   108
</UL>
clasohm@1339
   109
clasohm@1339
   110
</BODY></HTML>