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