src/HOL/README.html
author wenzelm
Wed Jun 24 21:46:54 2009 +0200 (2009-06-24)
changeset 31795 be3e1cc5005c
parent 15916 1314ef1e49dd
child 33026 8f35633c4922
permissions -rw-r--r--
standard naming conventions for session and theories;
     1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
     2 
     3 <!-- $Id$ -->
     4 
     5 <html>
     6 
     7 <head>
     8   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
     9   <title>HOL/README</title>
    10 </head>
    11 
    12 <body>
    13 
    14 <h2>HOL: Higher-Order Logic</h2>
    15 
    16 These are the main sources of the Isabelle system for Higher-Order Logic.
    17 
    18 <p>
    19 
    20 There are also several example sessions:
    21 <dl>
    22 
    23 <dt>Algebra
    24 <dd>rings and univariate polynomials
    25 
    26 <dt>Auth
    27 <dd>a new approach to verifying authentication protocols
    28 
    29 <dt>AxClasses
    30 <dd>a few basic examples of using axiomatic type classes
    31 
    32 <dt>Complex
    33 <dd>a development of the complex numbers, the reals, and the hyper-reals,
    34 which are used in non-standard analysis (builds the image HOL-Complex)
    35 
    36 <dt>Hoare
    37 <dd>verification of imperative programs (verification conditions are
    38 generated automatically from pre/post conditions and loop invariants)
    39 
    40 <dt>HoareParallel
    41 <dd>verification of shared-variable imperative programs a la Owicki-Gries.
    42 (verification conditions are generated automatically)
    43 
    44 <dt>Hyperreal
    45 <dd>Nonstandard analysis. Builds on Real and is part of Complex.
    46 
    47 <dt>IMP
    48 <dd>mechanization of a large part of a semantics text by Glynn Winskel
    49 
    50 <dt>IMPP
    51 <dd>extension of IMP with local variables and mutually recursive
    52 procedures
    53 
    54 <dt>Import
    55 <dd>theories imported from other (HOL) theorem provers.
    56 
    57 <dt>Induct
    58 <dd>examples of (co)inductive definitions
    59 
    60 <dt>IOA
    61 <dd>a simple theory of Input/Output Automata
    62 
    63 <dt>Isar_examples
    64 <dd>several introductory examples using Isabelle/Isar
    65 
    66 <dt>Lambda
    67 <dd>fundamental properties of lambda-calculus (Church-Rosser and termination)
    68 
    69 <dt>Lattice
    70 <dd>lattices and order structures (in Isabelle/Isar)
    71 
    72 <dt>Library
    73 <dd>A collection of generic theories
    74 
    75 <dt>Matrix
    76 <dd>two-dimensional matrices
    77 
    78 <dt>MicroJava
    79 <dd>formalization of a fragment of Java, together with a corresponding
    80 virtual machine and a specification of its bytecode verifier and a
    81 lightweight bytecode verifier, including proofs of type-safety
    82 
    83 <dt>Modelcheck
    84 <dd>basic setup for integration of some model checkers in Isabelle/HOL
    85 
    86 <dt>NanoJava
    87 <dd>Haore Logic for a tiny fragment of Java
    88 
    89 <dt>NumberTheory
    90 <dd>fundamental Theorem of Arithmetic, Chinese Remainder Theorem,
    91 Fermat/Euler Theorem, Wilson's Theorem, Quadratic Reciprocity
    92 
    93 <dt>Prolog
    94 <dd>a (bare-bones) implementation of Lambda-Prolog
    95 
    96 <dt>Real
    97 <dd>the real numbers, part of Complex
    98 
    99 <dt>Hahn_Banach
   100 <dd>the Hahn-Banach theorem for real vector spaces (in Isabelle/Isar)
   101 
   102 <dt>SET-Protocol
   103 <dd>verification of the SET Protocol
   104 
   105 <dt>Subst
   106 <dd>a theory of substitution and unification.
   107 
   108 <dt>TLA
   109 <dd>Lamport's Temporal Logic of Actions (with separate example sessions)
   110 
   111 <dt>UNITY
   112 <dd>Chandy and Misra's UNITY formalism
   113 
   114 <dt>W0
   115 <dd>a precursor of MiniML, without let-expressions
   116 
   117 <dt>ex
   118 <dd>miscellaneous examples
   119 
   120 </dl>
   121 
   122 </body>
   123 </html>