src/HOL/ROOT
author wenzelm
Tue Mar 12 21:59:48 2013 +0100 (2013-03-12)
changeset 51403 2ff3a5589b05
parent 51397 03b586ee5930
child 51421 b5d559b101d9
permissions -rw-r--r--
refurbished some old README.html files as session descriptions, which show up in chapter index;
wenzelm@51397
     1
chapter HOL
wenzelm@51397
     2
wenzelm@48738
     3
session HOL (main) = Pure +
wenzelm@48338
     4
  description {* Classical Higher-order Logic *}
wenzelm@48338
     5
  options [document_graph]
wenzelm@48338
     6
  theories Complex_Main
wenzelm@48901
     7
  files
wenzelm@48901
     8
    "Tools/Quickcheck/Narrowing_Engine.hs"
wenzelm@48901
     9
    "Tools/Quickcheck/PNF_Narrowing_Engine.hs"
wenzelm@48901
    10
    "document/root.bib"
wenzelm@48901
    11
    "document/root.tex"
wenzelm@48338
    12
wenzelm@48738
    13
session "HOL-Proofs" = Pure +
wenzelm@48509
    14
  description {* HOL-Main with explicit proof terms *}
wenzelm@50988
    15
  options [document = false, proofs = 2]
wenzelm@48338
    16
  theories Main
wenzelm@48901
    17
  files
wenzelm@48901
    18
    "Tools/Quickcheck/Narrowing_Engine.hs"
wenzelm@48901
    19
    "Tools/Quickcheck/PNF_Narrowing_Engine.hs"
wenzelm@48338
    20
wenzelm@50844
    21
session "HOL-Library" (main) in Library = HOL +
wenzelm@48481
    22
  description {* Classical Higher-order Logic -- batteries included *}
wenzelm@48481
    23
  theories
wenzelm@48481
    24
    Library
haftmann@51161
    25
    (*conflicting type class instantiations*)
wenzelm@48481
    26
    List_lexord
wenzelm@48481
    27
    Sublist_Order
haftmann@51115
    28
    Product_Lexorder
haftmann@51115
    29
    Product_Order
haftmann@51161
    30
    Finite_Lattice
haftmann@51161
    31
    (*data refinements and dependent applications*)
haftmann@51161
    32
    AList_Mapping
haftmann@51161
    33
    Code_Binary_Nat
haftmann@51161
    34
    Code_Char
wenzelm@48721
    35
    (* Code_Prolog  FIXME cf. 76965c356d2a *)
wenzelm@48481
    36
    Code_Real_Approx_By_Float
haftmann@50023
    37
    Code_Target_Numeral
haftmann@51161
    38
    DAList
haftmann@51161
    39
    RBT_Mapping
haftmann@51161
    40
    RBT_Set
haftmann@51161
    41
    (*legacy tools*)
blanchet@49985
    42
    Refute
haftmann@51161
    43
    Old_Recdef
wenzelm@48932
    44
  theories [condition = ISABELLE_FULL_TEST]
wenzelm@48932
    45
    Sum_of_Squares_Remote
wenzelm@48481
    46
  files "document/root.bib" "document/root.tex"
wenzelm@48481
    47
wenzelm@48738
    48
session "HOL-Hahn_Banach" in Hahn_Banach = HOL +
wenzelm@48481
    49
  description {*
wenzelm@48481
    50
    Author:     Gertrud Bauer, TU Munich
wenzelm@48481
    51
wenzelm@48481
    52
    The Hahn-Banach theorem for real vector spaces.
wenzelm@51403
    53
wenzelm@51403
    54
    This is the proof of the Hahn-Banach theorem for real vectorspaces,
wenzelm@51403
    55
    following H. Heuser, Funktionalanalysis, p. 228 -232. The Hahn-Banach
wenzelm@51403
    56
    theorem is one of the fundamental theorems of functioal analysis. It is a
wenzelm@51403
    57
    conclusion of Zorn's lemma.
wenzelm@51403
    58
wenzelm@51403
    59
    Two different formaulations of the theorem are presented, one for general
wenzelm@51403
    60
    real vectorspaces and its application to normed vectorspaces.
wenzelm@51403
    61
wenzelm@51403
    62
    The theorem says, that every continous linearform, defined on arbitrary
wenzelm@51403
    63
    subspaces (not only one-dimensional subspaces), can be extended to a
wenzelm@51403
    64
    continous linearform on the whole vectorspace.
wenzelm@48481
    65
  *}
wenzelm@48481
    66
  options [document_graph]
wenzelm@48481
    67
  theories Hahn_Banach
wenzelm@48481
    68
  files "document/root.bib" "document/root.tex"
wenzelm@48481
    69
wenzelm@48738
    70
session "HOL-Induct" in Induct = HOL +
wenzelm@51403
    71
  description {*
wenzelm@51403
    72
    Examples of (Co)Inductive Definitions.
wenzelm@51403
    73
wenzelm@51403
    74
    Comb proves the Church-Rosser theorem for combinators (see
wenzelm@51403
    75
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz).
wenzelm@51403
    76
wenzelm@51403
    77
    Mutil is the famous Mutilated Chess Board problem (see
wenzelm@51403
    78
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR394-lcp-mutilated-chess-board.dvi.gz).
wenzelm@51403
    79
wenzelm@51403
    80
    PropLog proves the completeness of a formalization of propositional logic
wenzelm@51403
    81
    (see
wenzelm@51403
    82
    HREF="http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz).
wenzelm@51403
    83
wenzelm@51403
    84
    Exp demonstrates the use of iterated inductive definitions to reason about
wenzelm@51403
    85
    mutually recursive relations.
wenzelm@51403
    86
  *}
wenzelm@48481
    87
  theories [quick_and_dirty]
wenzelm@48481
    88
    Common_Patterns
wenzelm@48481
    89
  theories
wenzelm@48481
    90
    QuoDataType
wenzelm@48481
    91
    QuoNestedDataType
wenzelm@48481
    92
    Term
wenzelm@48481
    93
    SList
wenzelm@48481
    94
    ABexp
wenzelm@48481
    95
    Tree
wenzelm@48481
    96
    Ordinals
wenzelm@48481
    97
    Sigma_Algebra
wenzelm@48481
    98
    Comb
wenzelm@48481
    99
    PropLog
wenzelm@48481
   100
    Com
wenzelm@48481
   101
  files "document/root.tex"
wenzelm@48481
   102
wenzelm@48738
   103
session "HOL-IMP" in IMP = HOL +
wenzelm@50870
   104
  options [document_graph, document_variants=document]
wenzelm@48481
   105
  theories [document = false]
wenzelm@48481
   106
    "~~/src/HOL/ex/Interpretation_with_Defs"
wenzelm@48481
   107
    "~~/src/HOL/Library/While_Combinator"
wenzelm@48481
   108
    "~~/src/HOL/Library/Char_ord"
wenzelm@48481
   109
    "~~/src/HOL/Library/List_lexord"
wenzelm@48481
   110
  theories
wenzelm@48481
   111
    BExp
wenzelm@48481
   112
    ASM
nipkow@50050
   113
    Finite_Reachable
wenzelm@48481
   114
    Denotation
wenzelm@48481
   115
    Comp_Rev
wenzelm@48481
   116
    Poly_Types
wenzelm@48481
   117
    Sec_Typing
wenzelm@48481
   118
    Sec_TypingT
nipkow@50161
   119
    Def_Init_Sound_Big
nipkow@50161
   120
    Def_Init_Sound_Small
wenzelm@48481
   121
    Live
wenzelm@48481
   122
    Live_True
wenzelm@48481
   123
    Hoare_Examples
wenzelm@48481
   124
    VC
wenzelm@48481
   125
    HoareT
wenzelm@48481
   126
    Collecting1
nipkow@48765
   127
    Collecting_Examples
wenzelm@48481
   128
    Abs_Int_Tests
wenzelm@48481
   129
    Abs_Int1_parity
wenzelm@48481
   130
    Abs_Int1_const
wenzelm@48481
   131
    Abs_Int3
wenzelm@48481
   132
    "Abs_Int_ITP/Abs_Int1_parity_ITP"
wenzelm@48481
   133
    "Abs_Int_ITP/Abs_Int1_const_ITP"
wenzelm@48481
   134
    "Abs_Int_ITP/Abs_Int3_ITP"
wenzelm@48481
   135
    "Abs_Int_Den/Abs_Int_den2"
wenzelm@48481
   136
    Procs_Dyn_Vars_Dyn
wenzelm@48481
   137
    Procs_Stat_Vars_Dyn
wenzelm@48481
   138
    Procs_Stat_Vars_Stat
wenzelm@48481
   139
    C_like
wenzelm@48481
   140
    OO
wenzelm@48481
   141
    Fold
wenzelm@48481
   142
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   143
wenzelm@48738
   144
session "HOL-IMPP" in IMPP = HOL +
wenzelm@48481
   145
  description {*
wenzelm@48481
   146
    Author:     David von Oheimb
wenzelm@48481
   147
    Copyright   1999 TUM
wenzelm@51403
   148
wenzelm@51403
   149
    IMPP -- An imperative language with procedures.
wenzelm@51403
   150
wenzelm@51403
   151
    This is an extension of IMP with local variables and mutually recursive
wenzelm@51403
   152
    procedures. For documentation see "Hoare Logic for Mutual Recursion and
wenzelm@51403
   153
    Local Variables" (http://isabelle.in.tum.de/Bali/papers/FSTTCS99.html).
wenzelm@48481
   154
  *}
wenzelm@48483
   155
  options [document = false]
wenzelm@48481
   156
  theories EvenOdd
wenzelm@48481
   157
wenzelm@48738
   158
session "HOL-Import" in Import = HOL +
wenzelm@48481
   159
  options [document_graph]
wenzelm@48481
   160
  theories HOL_Light_Maps
wenzelm@48481
   161
  theories [condition = HOL_LIGHT_BUNDLE] HOL_Light_Import
wenzelm@48481
   162
wenzelm@48738
   163
session "HOL-Number_Theory" in Number_Theory = HOL +
wenzelm@48483
   164
  options [document = false]
wenzelm@48481
   165
  theories Number_Theory
wenzelm@48481
   166
wenzelm@48738
   167
session "HOL-Old_Number_Theory" in Old_Number_Theory = HOL +
wenzelm@51403
   168
  description {*
wenzelm@51403
   169
    Fundamental Theorem of Arithmetic, Chinese Remainder Theorem, Fermat/Euler
wenzelm@51403
   170
    Theorem, Wilson's Theorem, Quadratic Reciprocity.
wenzelm@51403
   171
  *}
wenzelm@48481
   172
  options [document_graph]
wenzelm@48481
   173
  theories [document = false]
wenzelm@48481
   174
    "~~/src/HOL/Library/Infinite_Set"
wenzelm@48481
   175
    "~~/src/HOL/Library/Permutation"
wenzelm@48481
   176
  theories
wenzelm@48481
   177
    Fib
wenzelm@48481
   178
    Factorization
wenzelm@48481
   179
    Chinese
wenzelm@48481
   180
    WilsonRuss
wenzelm@48481
   181
    WilsonBij
wenzelm@48481
   182
    Quadratic_Reciprocity
wenzelm@48481
   183
    Primes
wenzelm@48481
   184
    Pocklington
wenzelm@48481
   185
  files "document/root.tex"
wenzelm@48481
   186
wenzelm@48738
   187
session "HOL-Hoare" in Hoare = HOL +
wenzelm@51403
   188
  description {*
wenzelm@51403
   189
    Verification of imperative programs (verification conditions are generated
wenzelm@51403
   190
    automatically from pre/post conditions and loop invariants).
wenzelm@51403
   191
  *}
wenzelm@51403
   192
wenzelm@48481
   193
  theories Hoare
wenzelm@48481
   194
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   195
wenzelm@48738
   196
session "HOL-Hoare_Parallel" in Hoare_Parallel = HOL +
wenzelm@51403
   197
  description {*
wenzelm@51403
   198
    Verification of shared-variable imperative programs a la Owicki-Gries.
wenzelm@51403
   199
    (verification conditions are generated automatically).
wenzelm@51403
   200
  *}
wenzelm@48481
   201
  options [document_graph]
wenzelm@48481
   202
  theories Hoare_Parallel
wenzelm@48481
   203
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   204
wenzelm@48738
   205
session "HOL-Codegenerator_Test" in Codegenerator_Test = "HOL-Library" +
wenzelm@48481
   206
  options [document = false, document_graph = false, browser_info = false]
haftmann@51161
   207
  theories Generate Generate_Binary_Nat Generate_Target_Nat Generate_Efficient_Datastructures Generate_Pretty_Char
wenzelm@48481
   208
wenzelm@48738
   209
session "HOL-Metis_Examples" in Metis_Examples = HOL +
wenzelm@48481
   210
  description {*
wenzelm@48481
   211
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   212
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   213
wenzelm@48481
   214
    Testing Metis and Sledgehammer.
wenzelm@48481
   215
  *}
wenzelm@48679
   216
  options [timeout = 3600, document = false]
wenzelm@48481
   217
  theories
wenzelm@48481
   218
    Abstraction
wenzelm@48481
   219
    Big_O
wenzelm@48481
   220
    Binary_Tree
wenzelm@48481
   221
    Clausification
wenzelm@48481
   222
    Message
wenzelm@48481
   223
    Proxies
wenzelm@48481
   224
    Tarski
wenzelm@48481
   225
    Trans_Closure
wenzelm@48481
   226
    Sets
wenzelm@48481
   227
wenzelm@48738
   228
session "HOL-Nitpick_Examples" in Nitpick_Examples = HOL +
wenzelm@48481
   229
  description {*
wenzelm@48481
   230
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   231
    Copyright   2009
wenzelm@48481
   232
  *}
wenzelm@48483
   233
  options [document = false]
wenzelm@48481
   234
  theories [quick_and_dirty] Nitpick_Examples
wenzelm@48481
   235
wenzelm@50844
   236
session "HOL-Algebra" (main) in Algebra = HOL +
wenzelm@48481
   237
  description {*
wenzelm@48481
   238
    Author: Clemens Ballarin, started 24 September 1999
wenzelm@48481
   239
wenzelm@48481
   240
    The Isabelle Algebraic Library.
wenzelm@48481
   241
  *}
wenzelm@48481
   242
  options [document_graph]
wenzelm@48481
   243
  theories [document = false]
wenzelm@48481
   244
    (* Preliminaries from set and number theory *)
wenzelm@48481
   245
    "~~/src/HOL/Library/FuncSet"
wenzelm@48481
   246
    "~~/src/HOL/Old_Number_Theory/Primes"
wenzelm@48481
   247
    "~~/src/HOL/Library/Binomial"
wenzelm@48481
   248
    "~~/src/HOL/Library/Permutation"
wenzelm@48481
   249
  theories
wenzelm@48481
   250
    (*** New development, based on explicit structures ***)
wenzelm@48481
   251
    (* Groups *)
wenzelm@48481
   252
    FiniteProduct        (* Product operator for commutative groups *)
wenzelm@48481
   253
    Sylow                (* Sylow's theorem *)
wenzelm@48481
   254
    Bij                  (* Automorphism Groups *)
wenzelm@48481
   255
wenzelm@48481
   256
    (* Rings *)
wenzelm@48481
   257
    Divisibility         (* Rings *)
wenzelm@48481
   258
    IntRing              (* Ideals and residue classes *)
wenzelm@48481
   259
    UnivPoly             (* Polynomials *)
wenzelm@48481
   260
  theories [document = false]
wenzelm@48481
   261
    (*** Old development, based on axiomatic type classes ***)
wenzelm@48481
   262
    "abstract/Abstract"  (*The ring theory*)
wenzelm@48481
   263
    "poly/Polynomial"    (*The full theory*)
wenzelm@48481
   264
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   265
wenzelm@48738
   266
session "HOL-Auth" in Auth = HOL +
wenzelm@51403
   267
  description {* A new approach to verifying authentication protocols. *}
wenzelm@48481
   268
  options [document_graph]
wenzelm@48481
   269
  theories
wenzelm@48481
   270
    Auth_Shared
wenzelm@48481
   271
    Auth_Public
wenzelm@48481
   272
    "Smartcard/Auth_Smartcard"
wenzelm@48481
   273
    "Guard/Auth_Guard_Shared"
wenzelm@48481
   274
    "Guard/Auth_Guard_Public"
wenzelm@48481
   275
  files "document/root.tex"
wenzelm@48481
   276
wenzelm@51236
   277
session "HOL-UNITY" in UNITY = "HOL-Auth" +
wenzelm@48481
   278
  description {*
wenzelm@48481
   279
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   280
    Copyright   1998  University of Cambridge
wenzelm@48481
   281
wenzelm@51403
   282
    Verifying security protocols using Chandy and Misra's UNITY formalism.
wenzelm@48481
   283
  *}
wenzelm@48481
   284
  options [document_graph]
wenzelm@48481
   285
  theories
wenzelm@48481
   286
    (*Basic meta-theory*)
wenzelm@48481
   287
    "UNITY_Main"
wenzelm@48481
   288
wenzelm@48481
   289
    (*Simple examples: no composition*)
wenzelm@48481
   290
    "Simple/Deadlock"
wenzelm@48481
   291
    "Simple/Common"
wenzelm@48481
   292
    "Simple/Network"
wenzelm@48481
   293
    "Simple/Token"
wenzelm@48481
   294
    "Simple/Channel"
wenzelm@48481
   295
    "Simple/Lift"
wenzelm@48481
   296
    "Simple/Mutex"
wenzelm@48481
   297
    "Simple/Reach"
wenzelm@48481
   298
    "Simple/Reachability"
wenzelm@48481
   299
wenzelm@48481
   300
    (*Verifying security protocols using UNITY*)
wenzelm@48481
   301
    "Simple/NSP_Bad"
wenzelm@48481
   302
wenzelm@48481
   303
    (*Example of composition*)
wenzelm@48481
   304
    "Comp/Handshake"
wenzelm@48481
   305
wenzelm@48481
   306
    (*Universal properties examples*)
wenzelm@48481
   307
    "Comp/Counter"
wenzelm@48481
   308
    "Comp/Counterc"
wenzelm@48481
   309
    "Comp/Priority"
wenzelm@48481
   310
wenzelm@48481
   311
    "Comp/TimerArray"
wenzelm@48481
   312
    "Comp/Progress"
wenzelm@48481
   313
wenzelm@48481
   314
    "Comp/Alloc"
wenzelm@48481
   315
    "Comp/AllocImpl"
wenzelm@48481
   316
    "Comp/Client"
wenzelm@48481
   317
wenzelm@48481
   318
    (*obsolete*)
wenzelm@48481
   319
    "ELT"
wenzelm@48481
   320
  files "document/root.tex"
wenzelm@48481
   321
wenzelm@48738
   322
session "HOL-Unix" in Unix = HOL +
wenzelm@48481
   323
  options [print_mode = "no_brackets,no_type_brackets"]
wenzelm@48481
   324
  theories Unix
wenzelm@48481
   325
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   326
wenzelm@48738
   327
session "HOL-ZF" in ZF = HOL +
wenzelm@48481
   328
  theories MainZF Games
wenzelm@48481
   329
  files "document/root.tex"
wenzelm@48481
   330
wenzelm@48738
   331
session "HOL-Imperative_HOL" in Imperative_HOL = HOL +
wenzelm@48481
   332
  options [document_graph, print_mode = "iff,no_brackets"]
wenzelm@48481
   333
  theories [document = false]
wenzelm@48481
   334
    "~~/src/HOL/Library/Countable"
wenzelm@48481
   335
    "~~/src/HOL/Library/Monad_Syntax"
wenzelm@48481
   336
    "~~/src/HOL/Library/LaTeXsugar"
wenzelm@48481
   337
  theories Imperative_HOL_ex
wenzelm@48481
   338
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   339
wenzelm@48738
   340
session "HOL-Decision_Procs" in Decision_Procs = HOL +
wenzelm@48496
   341
  options [condition = ISABELLE_POLYML, document = false]
wenzelm@48481
   342
  theories Decision_Procs
wenzelm@48481
   343
wenzelm@48738
   344
session "HOL-Proofs-ex" in "Proofs/ex" = "HOL-Proofs" +
wenzelm@48483
   345
  options [document = false, proofs = 2, parallel_proofs = 0]
wenzelm@48481
   346
  theories Hilbert_Classical
wenzelm@48481
   347
wenzelm@48738
   348
session "HOL-Proofs-Extraction" in "Proofs/Extraction" = "HOL-Proofs" +
wenzelm@48481
   349
  description {* Examples for program extraction in Higher-Order Logic *}
wenzelm@48496
   350
  options [condition = ISABELLE_POLYML, proofs = 2, parallel_proofs = 0]
wenzelm@48481
   351
  theories [document = false]
haftmann@51143
   352
    "~~/src/HOL/Library/Code_Target_Numeral"
wenzelm@48481
   353
    "~~/src/HOL/Library/Monad_Syntax"
wenzelm@48481
   354
    "~~/src/HOL/Number_Theory/Primes"
wenzelm@48481
   355
    "~~/src/HOL/Number_Theory/UniqueFactorization"
wenzelm@48481
   356
    "~~/src/HOL/Library/State_Monad"
wenzelm@48481
   357
  theories
wenzelm@48481
   358
    Greatest_Common_Divisor
wenzelm@48481
   359
    Warshall
wenzelm@48481
   360
    Higman_Extraction
wenzelm@48481
   361
    Pigeonhole
wenzelm@48481
   362
    Euclid
wenzelm@48481
   363
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   364
wenzelm@48738
   365
session "HOL-Proofs-Lambda" in "Proofs/Lambda" = "HOL-Proofs" +
wenzelm@51403
   366
  description {*
wenzelm@51403
   367
    Lambda Calculus in de Bruijn's Notation.
wenzelm@51403
   368
wenzelm@51403
   369
    This session defines lambda-calculus terms with de Bruijn indixes and
wenzelm@51403
   370
    proves confluence of beta, eta and beta+eta.
wenzelm@51403
   371
wenzelm@51403
   372
    The paper "More Church-Rosser Proofs (in Isabelle/HOL)" describes the whole
wenzelm@51403
   373
    theory (see http://www.in.tum.de/~nipkow/pubs/jar2001.html).
wenzelm@51403
   374
  *}
wenzelm@48481
   375
  options [document_graph, print_mode = "no_brackets", proofs = 2, parallel_proofs = 0]
wenzelm@48481
   376
  theories [document = false]
haftmann@51143
   377
    "~~/src/HOL/Library/Code_Target_Int"
wenzelm@48481
   378
  theories
wenzelm@48481
   379
    Eta
wenzelm@48481
   380
    StrongNorm
wenzelm@48481
   381
    Standardization
wenzelm@48481
   382
    WeakNorm
wenzelm@48481
   383
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   384
wenzelm@48738
   385
session "HOL-Prolog" in Prolog = HOL +
wenzelm@48481
   386
  description {*
wenzelm@48481
   387
    Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
wenzelm@51403
   388
wenzelm@51403
   389
    A bare-bones implementation of Lambda-Prolog.
wenzelm@51403
   390
wenzelm@51403
   391
    This is a simple exploratory implementation of Lambda-Prolog in HOL,
wenzelm@51403
   392
    including some minimal examples (in Test.thy) and a more typical example of
wenzelm@51403
   393
    a little functional language and its type system.
wenzelm@48481
   394
  *}
wenzelm@48483
   395
  options [document = false]
wenzelm@48481
   396
  theories Test Type
wenzelm@48481
   397
wenzelm@48738
   398
session "HOL-MicroJava" in MicroJava = HOL +
wenzelm@51403
   399
  description {*
wenzelm@51403
   400
    Formalization of a fragment of Java, together with a corresponding virtual
wenzelm@51403
   401
    machine and a specification of its bytecode verifier and a lightweight
wenzelm@51403
   402
    bytecode verifier, including proofs of type-safety.
wenzelm@51403
   403
  *}
wenzelm@48481
   404
  options [document_graph]
wenzelm@48481
   405
  theories [document = false] "~~/src/HOL/Library/While_Combinator"
wenzelm@48481
   406
  theories MicroJava
wenzelm@48481
   407
  files
wenzelm@48481
   408
    "document/introduction.tex"
wenzelm@48481
   409
    "document/root.bib"
wenzelm@48481
   410
    "document/root.tex"
wenzelm@48481
   411
wenzelm@48738
   412
session "HOL-MicroJava-skip_proofs" in MicroJava = HOL +
wenzelm@48636
   413
  options [condition = ISABELLE_FULL_TEST, document = false, skip_proofs, quick_and_dirty]
wenzelm@48636
   414
  theories MicroJava
wenzelm@48636
   415
wenzelm@48738
   416
session "HOL-NanoJava" in NanoJava = HOL +
wenzelm@51403
   417
  description {*
wenzelm@51403
   418
    Hoare Logic for a tiny fragment of Java.
wenzelm@51403
   419
  *}
wenzelm@48481
   420
  options [document_graph]
wenzelm@48481
   421
  theories Example
wenzelm@48481
   422
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   423
wenzelm@48738
   424
session "HOL-Bali" in Bali = HOL +
wenzelm@48481
   425
  options [document_graph]
wenzelm@48481
   426
  theories
wenzelm@48481
   427
    AxExample
wenzelm@48481
   428
    AxSound
wenzelm@48481
   429
    AxCompl
wenzelm@48481
   430
    Trans
wenzelm@48481
   431
  files "document/root.tex"
wenzelm@48481
   432
wenzelm@48738
   433
session "HOL-IOA" in IOA = HOL +
wenzelm@48481
   434
  description {*
wenzelm@51403
   435
    Author:     Tobias Nipkow and Konrad Slind and Olaf Müller
wenzelm@51403
   436
    Copyright   1994--1996  TU Muenchen
wenzelm@48481
   437
wenzelm@51403
   438
    The meta theory of I/O-Automata in HOL. This formalization has been
wenzelm@51403
   439
    significantly changed and extended, see HOLCF/IOA. There are also the
wenzelm@51403
   440
    proofs of two communication protocols which formerly have been here.
wenzelm@48481
   441
wenzelm@48481
   442
    @inproceedings{Nipkow-Slind-IOA,
wenzelm@48481
   443
    author={Tobias Nipkow and Konrad Slind},
wenzelm@48481
   444
    title={{I/O} Automata in {Isabelle/HOL}},
wenzelm@48481
   445
    booktitle={Proc.\ TYPES Workshop 1994},
wenzelm@48481
   446
    publisher=Springer,
wenzelm@48481
   447
    series=LNCS,
wenzelm@48481
   448
    note={To appear}}
wenzelm@48481
   449
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/ioa.ps.gz
wenzelm@48481
   450
wenzelm@48481
   451
    and
wenzelm@48481
   452
wenzelm@48481
   453
    @inproceedings{Mueller-Nipkow,
wenzelm@48481
   454
    author={Olaf M\"uller and Tobias Nipkow},
wenzelm@48481
   455
    title={Combining Model Checking and Deduction for {I/O}-Automata},
wenzelm@48481
   456
    booktitle={Proc.\ TACAS Workshop},
wenzelm@48481
   457
    organization={Aarhus University, BRICS report},
wenzelm@48481
   458
    year=1995}
wenzelm@48481
   459
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/tacas.dvi.gz
wenzelm@48481
   460
  *}
wenzelm@48483
   461
  options [document = false]
wenzelm@48481
   462
  theories Solve
wenzelm@48481
   463
wenzelm@48738
   464
session "HOL-Lattice" in Lattice = HOL +
wenzelm@48481
   465
  description {*
wenzelm@48481
   466
    Author:     Markus Wenzel, TU Muenchen
wenzelm@48481
   467
wenzelm@48481
   468
    Basic theory of lattices and orders.
wenzelm@48481
   469
  *}
wenzelm@48481
   470
  theories CompleteLattice
wenzelm@48481
   471
  files "document/root.tex"
wenzelm@48481
   472
wenzelm@48738
   473
session "HOL-ex" in ex = HOL +
wenzelm@48481
   474
  description {* Miscellaneous examples for Higher-Order Logic. *}
wenzelm@48679
   475
  options [timeout = 3600, condition = ISABELLE_POLYML]
wenzelm@48481
   476
  theories [document = false]
wenzelm@48481
   477
    "~~/src/HOL/Library/State_Monad"
haftmann@50023
   478
    Code_Binary_Nat_examples
wenzelm@48481
   479
    "~~/src/HOL/Library/FuncSet"
wenzelm@48481
   480
    Eval_Examples
wenzelm@48481
   481
    Normalization_by_Evaluation
wenzelm@48481
   482
    Hebrew
wenzelm@48481
   483
    Chinese
wenzelm@48481
   484
    Serbian
wenzelm@48481
   485
    "~~/src/HOL/Library/FinFun_Syntax"
blanchet@49985
   486
    "~~/src/HOL/Library/Refute"
wenzelm@48481
   487
  theories
wenzelm@48481
   488
    Iff_Oracle
wenzelm@48481
   489
    Coercion_Examples
wenzelm@48481
   490
    Numeral_Representation
wenzelm@48481
   491
    Higher_Order_Logic
wenzelm@48481
   492
    Abstract_NAT
wenzelm@48481
   493
    Guess
wenzelm@48481
   494
    Binary
wenzelm@48481
   495
    Fundefs
wenzelm@48481
   496
    Induction_Schema
wenzelm@48481
   497
    LocaleTest2
wenzelm@48481
   498
    Records
wenzelm@48481
   499
    While_Combinator_Example
wenzelm@48481
   500
    MonoidGroup
wenzelm@48481
   501
    BinEx
wenzelm@48481
   502
    Hex_Bin_Examples
wenzelm@48481
   503
    Antiquote
wenzelm@48481
   504
    Multiquote
wenzelm@48481
   505
    PER
wenzelm@48481
   506
    NatSum
wenzelm@48481
   507
    ThreeDivides
wenzelm@48481
   508
    Intuitionistic
wenzelm@48481
   509
    CTL
wenzelm@48481
   510
    Arith_Examples
wenzelm@48481
   511
    BT
wenzelm@48481
   512
    Tree23
wenzelm@48481
   513
    MergeSort
wenzelm@48481
   514
    Lagrange
wenzelm@48481
   515
    Groebner_Examples
wenzelm@48481
   516
    MT
wenzelm@48481
   517
    Unification
wenzelm@48481
   518
    Primrec
wenzelm@48481
   519
    Tarski
wenzelm@48481
   520
    Classical
wenzelm@48481
   521
    Set_Theory
wenzelm@48481
   522
    Meson_Test
wenzelm@48481
   523
    Termination
wenzelm@48481
   524
    Coherent
wenzelm@48481
   525
    PresburgerEx
haftmann@51093
   526
    Reflection_Examples
wenzelm@48481
   527
    Sqrt
wenzelm@48481
   528
    Sqrt_Script
wenzelm@48481
   529
    Transfer_Ex
wenzelm@48481
   530
    Transfer_Int_Nat
wenzelm@48481
   531
    HarmonicSeries
wenzelm@48481
   532
    Refute_Examples
wenzelm@48481
   533
    Execute_Choice
wenzelm@48481
   534
    Summation
wenzelm@48481
   535
    Gauge_Integration
wenzelm@48481
   536
    Dedekind_Real
wenzelm@48481
   537
    Quicksort
wenzelm@48481
   538
    Birthday_Paradox
wenzelm@48481
   539
    List_to_Set_Comprehension_Examples
wenzelm@48481
   540
    Seq
wenzelm@48481
   541
    Simproc_Tests
wenzelm@48481
   542
    Executable_Relation
wenzelm@48481
   543
    FinFunPred
wenzelm@48481
   544
    Set_Comprehension_Pointfree_Tests
wenzelm@48481
   545
    Parallel_Example
nipkow@50138
   546
    IArray_Examples
wenzelm@48481
   547
  theories SVC_Oracle
wenzelm@48690
   548
  theories [condition = SVC_HOME]
wenzelm@48690
   549
    svc_test
wenzelm@48481
   550
  theories [condition = ZCHAFF_HOME]
wenzelm@48481
   551
    (*requires zChaff (or some other reasonably fast SAT solver)*)
wenzelm@48481
   552
    Sudoku
wenzelm@48481
   553
(* FIXME
wenzelm@48481
   554
(*requires a proof-generating SAT solver (zChaff or MiniSAT)*)
wenzelm@48481
   555
(*global side-effects ahead!*)
wenzelm@48481
   556
try use_thy "SAT_Examples";   (* FIXME try!? (not really a proper test) *)
wenzelm@48481
   557
*)
wenzelm@48481
   558
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   559
wenzelm@48738
   560
session "HOL-Isar_Examples" in Isar_Examples = HOL +
wenzelm@51403
   561
  description {*
wenzelm@51403
   562
    Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm@51403
   563
  *}
wenzelm@48481
   564
  theories [document = false]
wenzelm@48481
   565
    "~~/src/HOL/Library/Lattice_Syntax"
wenzelm@48481
   566
    "../Number_Theory/Primes"
wenzelm@48481
   567
  theories
wenzelm@48481
   568
    Basic_Logic
wenzelm@48481
   569
    Cantor
wenzelm@48481
   570
    Drinker
wenzelm@48481
   571
    Expr_Compiler
wenzelm@48481
   572
    Fibonacci
wenzelm@48481
   573
    Group
wenzelm@48481
   574
    Group_Context
wenzelm@48481
   575
    Group_Notepad
wenzelm@48481
   576
    Hoare_Ex
wenzelm@48481
   577
    Knaster_Tarski
wenzelm@48481
   578
    Mutilated_Checkerboard
wenzelm@48481
   579
    Nested_Datatype
wenzelm@48481
   580
    Peirce
wenzelm@48481
   581
    Puzzle
wenzelm@48481
   582
    Summation
wenzelm@48481
   583
  files
wenzelm@48481
   584
    "document/root.bib"
wenzelm@48481
   585
    "document/root.tex"
wenzelm@48481
   586
    "document/style.tex"
wenzelm@48481
   587
wenzelm@48738
   588
session "HOL-SET_Protocol" in SET_Protocol = HOL +
wenzelm@51403
   589
  description {*
wenzelm@51403
   590
    Verification of the SET Protocol.
wenzelm@51403
   591
  *}
wenzelm@48481
   592
  options [document_graph]
wenzelm@48481
   593
  theories [document = false] "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48481
   594
  theories SET_Protocol
wenzelm@48481
   595
  files "document/root.tex"
wenzelm@48481
   596
wenzelm@48738
   597
session "HOL-Matrix_LP" in Matrix_LP = HOL +
wenzelm@51403
   598
  description {*
wenzelm@51403
   599
    Two-dimensional matrices and linear programming.
wenzelm@51403
   600
  *}
wenzelm@48481
   601
  options [document_graph]
wenzelm@48481
   602
  theories Cplex
wenzelm@48481
   603
  files "document/root.tex"
wenzelm@48481
   604
wenzelm@48738
   605
session "HOL-TLA" in TLA = HOL +
wenzelm@51403
   606
  description {*
wenzelm@51403
   607
    Lamport's Temporal Logic of Actions.
wenzelm@51403
   608
  *}
wenzelm@48483
   609
  options [document = false]
wenzelm@48481
   610
  theories TLA
wenzelm@48481
   611
wenzelm@48738
   612
session "HOL-TLA-Inc" in "TLA/Inc" = "HOL-TLA" +
wenzelm@48483
   613
  options [document = false]
wenzelm@48481
   614
  theories Inc
wenzelm@48481
   615
wenzelm@48738
   616
session "HOL-TLA-Buffer" in "TLA/Buffer" = "HOL-TLA" +
wenzelm@48483
   617
  options [document = false]
wenzelm@48481
   618
  theories DBuffer
wenzelm@48481
   619
wenzelm@48738
   620
session "HOL-TLA-Memory" in "TLA/Memory" = "HOL-TLA" +
wenzelm@48483
   621
  options [document = false]
wenzelm@48481
   622
  theories MemoryImplementation
wenzelm@48481
   623
wenzelm@48738
   624
session "HOL-TPTP" in TPTP = HOL +
wenzelm@48481
   625
  description {*
wenzelm@48481
   626
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   627
    Author:     Nik Sultana, University of Cambridge
wenzelm@48481
   628
    Copyright   2011
wenzelm@48481
   629
wenzelm@48481
   630
    TPTP-related extensions.
wenzelm@48481
   631
  *}
wenzelm@48483
   632
  options [document = false]
wenzelm@48481
   633
  theories
wenzelm@48481
   634
    ATP_Theory_Export
wenzelm@48481
   635
    MaSh_Eval
wenzelm@48481
   636
    MaSh_Export
wenzelm@48481
   637
    TPTP_Interpret
wenzelm@48481
   638
    THF_Arith
wenzelm@48481
   639
  theories [proofs = 0]  (* FIXME !? *)
wenzelm@48481
   640
    ATP_Problem_Import
wenzelm@48481
   641
wenzelm@50844
   642
session "HOL-Multivariate_Analysis" (main) in Multivariate_Analysis = HOL +
wenzelm@48481
   643
  options [document_graph]
wenzelm@48481
   644
  theories
wenzelm@48481
   645
    Multivariate_Analysis
wenzelm@48481
   646
    Determinants
wenzelm@48481
   647
  files
wenzelm@48481
   648
    "document/root.tex"
wenzelm@48481
   649
wenzelm@48738
   650
session "HOL-Probability" in "Probability" = "HOL-Multivariate_Analysis" +
wenzelm@48617
   651
  options [document_graph]
wenzelm@48481
   652
  theories [document = false]
wenzelm@48481
   653
    "~~/src/HOL/Library/Countable"
wenzelm@48481
   654
    "~~/src/HOL/Multivariate_Analysis/Extended_Real_Limits"
wenzelm@48481
   655
    "~~/src/HOL/Library/Permutation"
wenzelm@48481
   656
  theories
wenzelm@48481
   657
    Probability
wenzelm@48481
   658
    "ex/Dining_Cryptographers"
wenzelm@48481
   659
    "ex/Koepf_Duermuth_Countermeasure"
wenzelm@48481
   660
  files "document/root.tex"
wenzelm@48481
   661
wenzelm@48738
   662
session "HOL-Nominal" (main) in Nominal = HOL +
wenzelm@48483
   663
  options [document = false]
wenzelm@48481
   664
  theories Nominal
wenzelm@48481
   665
wenzelm@48738
   666
session "HOL-Nominal-Examples" in "Nominal/Examples" = "HOL-Nominal" +
wenzelm@48679
   667
  options [timeout = 3600, condition = ISABELLE_POLYML, document = false]
wenzelm@48481
   668
  theories Nominal_Examples
wenzelm@48481
   669
  theories [quick_and_dirty] VC_Condition
wenzelm@48481
   670
blanchet@49310
   671
session "HOL-Cardinals-Base" in Cardinals = HOL +
blanchet@48978
   672
  description {* Ordinals and Cardinals, Base Theories *}
blanchet@48975
   673
  options [document = false]
blanchet@48975
   674
  theories Cardinal_Arithmetic
blanchet@48975
   675
blanchet@49310
   676
session "HOL-Cardinals" in Cardinals = "HOL-Cardinals-Base" +
blanchet@48978
   677
  description {* Ordinals and Cardinals, Full Theories *}
blanchet@49511
   678
  options [document = false]
popescua@49439
   679
  theories Cardinals
wenzelm@48984
   680
  files
wenzelm@48984
   681
    "document/intro.tex"
wenzelm@48984
   682
    "document/root.tex"
wenzelm@48984
   683
    "document/root.bib"
blanchet@48975
   684
blanchet@49511
   685
session "HOL-BNF-LFP" in BNF = "HOL-Cardinals-Base" +
blanchet@49511
   686
  description {* Bounded Natural Functors for Datatypes *}
blanchet@49511
   687
  options [document = false]
blanchet@49511
   688
  theories BNF_LFP
blanchet@49511
   689
blanchet@49517
   690
session "HOL-BNF" in BNF = "HOL-Cardinals" +
blanchet@49510
   691
  description {* Bounded Natural Functors for (Co)datatypes *}
blanchet@48975
   692
  options [document = false]
blanchet@49510
   693
  theories BNF
blanchet@48975
   694
blanchet@49510
   695
session "HOL-BNF-Examples" in "BNF/Examples" = "HOL-BNF" +
blanchet@49510
   696
  description {* Examples for Bounded Natural Functors *}
wenzelm@49932
   697
  options [document = false]
blanchet@48975
   698
  theories
blanchet@48975
   699
    Lambda_Term
blanchet@48975
   700
    Process
blanchet@48975
   701
    TreeFsetI
popescua@49872
   702
    "Derivation_Trees/Gram_Lang"
popescua@49872
   703
    "Derivation_Trees/Parallel"
traytel@50517
   704
    Koenig
blanchet@49693
   705
  theories [condition = ISABELLE_FULL_TEST]
blanchet@48975
   706
    Misc_Codata
blanchet@48975
   707
    Misc_Data
blanchet@48975
   708
wenzelm@50844
   709
session "HOL-Word" (main) in Word = HOL +
wenzelm@48481
   710
  options [document_graph]
wenzelm@48481
   711
  theories Word
wenzelm@48481
   712
  files "document/root.bib" "document/root.tex"
wenzelm@48481
   713
wenzelm@48738
   714
session "HOL-Word-Examples" in "Word/Examples" = "HOL-Word" +
wenzelm@48483
   715
  options [document = false]
wenzelm@48481
   716
  theories WordExamples
wenzelm@48481
   717
wenzelm@48738
   718
session "HOL-Statespace" in Statespace = HOL +
wenzelm@48481
   719
  theories StateSpaceEx
wenzelm@48481
   720
  files "document/root.tex"
wenzelm@48481
   721
wenzelm@48738
   722
session "HOL-NSA" in NSA = HOL +
wenzelm@51403
   723
  description {* Nonstandard analysis. *}
wenzelm@48481
   724
  options [document_graph]
wenzelm@48481
   725
  theories Hypercomplex
wenzelm@48481
   726
  files "document/root.tex"
wenzelm@48481
   727
wenzelm@48738
   728
session "HOL-NSA-Examples" in "NSA/Examples" = "HOL-NSA" +
wenzelm@48483
   729
  options [document = false]
wenzelm@48481
   730
  theories NSPrimes
wenzelm@48481
   731
wenzelm@48738
   732
session "HOL-Mirabelle" in Mirabelle = HOL +
wenzelm@48483
   733
  options [document = false]
wenzelm@48481
   734
  theories Mirabelle_Test
wenzelm@48589
   735
wenzelm@48738
   736
session "HOL-Mirabelle-ex" in "Mirabelle/ex" = "HOL-Mirabelle" +
wenzelm@49448
   737
  options [document = false, timeout = 60]
wenzelm@49448
   738
  theories Ex
wenzelm@48481
   739
wenzelm@48738
   740
session "HOL-Word-SMT_Examples" in SMT_Examples = "HOL-Word" +
wenzelm@48483
   741
  options [document = false, quick_and_dirty]
wenzelm@48481
   742
  theories
wenzelm@48481
   743
    SMT_Examples
wenzelm@48481
   744
    SMT_Word_Examples
blanchet@50666
   745
  theories [condition = ISABELLE_FULL_TEST]
blanchet@50666
   746
    SMT_Tests
wenzelm@48481
   747
  files
wenzelm@48481
   748
    "SMT_Examples.certs"
blanchet@50665
   749
    "SMT_Word_Examples.certs"
wenzelm@48481
   750
wenzelm@48738
   751
session "HOL-Boogie" in "Boogie" = "HOL-Word" +
wenzelm@48483
   752
  options [document = false]
wenzelm@48481
   753
  theories Boogie
wenzelm@48481
   754
wenzelm@48738
   755
session "HOL-Boogie-Examples" in "Boogie/Examples" = "HOL-Boogie" +
wenzelm@48483
   756
  options [document = false]
wenzelm@48481
   757
  theories
wenzelm@48481
   758
    Boogie_Max_Stepwise
wenzelm@48481
   759
    Boogie_Max
wenzelm@48481
   760
    Boogie_Dijkstra
wenzelm@48481
   761
    VCC_Max
wenzelm@48481
   762
  files
wenzelm@48493
   763
    "Boogie_Dijkstra.b2i"
wenzelm@48481
   764
    "Boogie_Dijkstra.certs"
wenzelm@48493
   765
    "Boogie_Max.b2i"
wenzelm@48481
   766
    "Boogie_Max.certs"
wenzelm@48493
   767
    "VCC_Max.b2i"
wenzelm@48481
   768
    "VCC_Max.certs"
wenzelm@48481
   769
wenzelm@50844
   770
session "HOL-SPARK" (main) in "SPARK" = "HOL-Word" +
wenzelm@48483
   771
  options [document = false]
wenzelm@48481
   772
  theories SPARK
wenzelm@48481
   773
wenzelm@48738
   774
session "HOL-SPARK-Examples" in "SPARK/Examples" = "HOL-SPARK" +
wenzelm@48483
   775
  options [document = false]
wenzelm@48481
   776
  theories
wenzelm@48481
   777
    "Gcd/Greatest_Common_Divisor"
wenzelm@48481
   778
wenzelm@48481
   779
    "Liseq/Longest_Increasing_Subsequence"
wenzelm@48481
   780
wenzelm@48481
   781
    "RIPEMD-160/F"
wenzelm@48481
   782
    "RIPEMD-160/Hash"
wenzelm@48481
   783
    "RIPEMD-160/K_L"
wenzelm@48481
   784
    "RIPEMD-160/K_R"
wenzelm@48481
   785
    "RIPEMD-160/R_L"
wenzelm@48481
   786
    "RIPEMD-160/Round"
wenzelm@48481
   787
    "RIPEMD-160/R_R"
wenzelm@48481
   788
    "RIPEMD-160/S_L"
wenzelm@48481
   789
    "RIPEMD-160/S_R"
wenzelm@48481
   790
wenzelm@48481
   791
    "Sqrt/Sqrt"
wenzelm@48481
   792
  files
wenzelm@48481
   793
    "Gcd/greatest_common_divisor/g_c_d.fdl"
wenzelm@48481
   794
    "Gcd/greatest_common_divisor/g_c_d.rls"
wenzelm@48481
   795
    "Gcd/greatest_common_divisor/g_c_d.siv"
wenzelm@48481
   796
    "Liseq/liseq/liseq_length.fdl"
wenzelm@48481
   797
    "Liseq/liseq/liseq_length.rls"
wenzelm@48481
   798
    "Liseq/liseq/liseq_length.siv"
wenzelm@48481
   799
    "RIPEMD-160/rmd/f.fdl"
wenzelm@48481
   800
    "RIPEMD-160/rmd/f.rls"
wenzelm@48481
   801
    "RIPEMD-160/rmd/f.siv"
wenzelm@48481
   802
    "RIPEMD-160/rmd/hash.fdl"
wenzelm@48481
   803
    "RIPEMD-160/rmd/hash.rls"
wenzelm@48481
   804
    "RIPEMD-160/rmd/hash.siv"
wenzelm@48481
   805
    "RIPEMD-160/rmd/k_l.fdl"
wenzelm@48481
   806
    "RIPEMD-160/rmd/k_l.rls"
wenzelm@48481
   807
    "RIPEMD-160/rmd/k_l.siv"
wenzelm@48481
   808
    "RIPEMD-160/rmd/k_r.fdl"
wenzelm@48481
   809
    "RIPEMD-160/rmd/k_r.rls"
wenzelm@48481
   810
    "RIPEMD-160/rmd/k_r.siv"
wenzelm@48481
   811
    "RIPEMD-160/rmd/r_l.fdl"
wenzelm@48481
   812
    "RIPEMD-160/rmd/r_l.rls"
wenzelm@48481
   813
    "RIPEMD-160/rmd/r_l.siv"
wenzelm@48481
   814
    "RIPEMD-160/rmd/round.fdl"
wenzelm@48481
   815
    "RIPEMD-160/rmd/round.rls"
wenzelm@48481
   816
    "RIPEMD-160/rmd/round.siv"
wenzelm@48481
   817
    "RIPEMD-160/rmd/r_r.fdl"
wenzelm@48481
   818
    "RIPEMD-160/rmd/r_r.rls"
wenzelm@48481
   819
    "RIPEMD-160/rmd/r_r.siv"
wenzelm@48481
   820
    "RIPEMD-160/rmd/s_l.fdl"
wenzelm@48481
   821
    "RIPEMD-160/rmd/s_l.rls"
wenzelm@48481
   822
    "RIPEMD-160/rmd/s_l.siv"
wenzelm@48481
   823
    "RIPEMD-160/rmd/s_r.fdl"
wenzelm@48481
   824
    "RIPEMD-160/rmd/s_r.rls"
wenzelm@48481
   825
    "RIPEMD-160/rmd/s_r.siv"
wenzelm@48481
   826
wenzelm@48738
   827
session "HOL-SPARK-Manual" in "SPARK/Manual" = "HOL-SPARK" +
wenzelm@48486
   828
  options [show_question_marks = false]
wenzelm@48481
   829
  theories
wenzelm@48481
   830
    Example_Verification
wenzelm@48481
   831
    VC_Principles
wenzelm@48481
   832
    Reference
wenzelm@48481
   833
    Complex_Types
wenzelm@48481
   834
  files
wenzelm@48481
   835
    "complex_types_app/initialize.fdl"
wenzelm@48481
   836
    "complex_types_app/initialize.rls"
wenzelm@48481
   837
    "complex_types_app/initialize.siv"
wenzelm@48481
   838
    "document/complex_types.ads"
wenzelm@48481
   839
    "document/complex_types_app.adb"
wenzelm@48481
   840
    "document/complex_types_app.ads"
wenzelm@48481
   841
    "document/Gcd.adb"
wenzelm@48481
   842
    "document/Gcd.ads"
wenzelm@48481
   843
    "document/intro.tex"
wenzelm@48481
   844
    "document/loop_invariant.adb"
wenzelm@48481
   845
    "document/loop_invariant.ads"
wenzelm@48481
   846
    "document/root.bib"
wenzelm@48481
   847
    "document/root.tex"
wenzelm@48481
   848
    "document/Simple_Gcd.adb"
wenzelm@48481
   849
    "document/Simple_Gcd.ads"
wenzelm@48481
   850
    "loop_invariant/proc1.fdl"
wenzelm@48481
   851
    "loop_invariant/proc1.rls"
wenzelm@48481
   852
    "loop_invariant/proc1.siv"
wenzelm@48481
   853
    "loop_invariant/proc2.fdl"
wenzelm@48481
   854
    "loop_invariant/proc2.rls"
wenzelm@48481
   855
    "loop_invariant/proc2.siv"
wenzelm@48481
   856
    "simple_greatest_common_divisor/g_c_d.fdl"
wenzelm@48481
   857
    "simple_greatest_common_divisor/g_c_d.rls"
wenzelm@48481
   858
    "simple_greatest_common_divisor/g_c_d.siv"
wenzelm@48481
   859
wenzelm@48738
   860
session "HOL-Mutabelle" in Mutabelle = HOL +
wenzelm@48483
   861
  options [document = false]
wenzelm@48481
   862
  theories MutabelleExtra
wenzelm@48481
   863
wenzelm@48738
   864
session "HOL-Quickcheck_Examples" in Quickcheck_Examples = HOL +
wenzelm@50179
   865
  options [document = false]
wenzelm@48588
   866
  theories
wenzelm@48690
   867
    Quickcheck_Examples
wenzelm@48690
   868
  (* FIXME
wenzelm@48690
   869
    Quickcheck_Lattice_Examples
wenzelm@48690
   870
    Completeness
wenzelm@48690
   871
    Quickcheck_Interfaces
wenzelm@48690
   872
    Hotel_Example *)
wenzelm@48598
   873
  theories [condition = ISABELLE_GHC]
wenzelm@48598
   874
    Quickcheck_Narrowing_Examples
wenzelm@48588
   875
wenzelm@48738
   876
session "HOL-Quickcheck_Benchmark" in Quickcheck_Benchmark = HOL +
wenzelm@50571
   877
  theories [condition = ISABELLE_FULL_TEST, quick_and_dirty]
bulwahn@50568
   878
    Find_Unused_Assms_Examples
bulwahn@48618
   879
    Needham_Schroeder_No_Attacker_Example
bulwahn@48618
   880
    Needham_Schroeder_Guided_Attacker_Example
wenzelm@48690
   881
    Needham_Schroeder_Unguided_Attacker_Example
wenzelm@48481
   882
wenzelm@48738
   883
session "HOL-Quotient_Examples" in Quotient_Examples = HOL +
wenzelm@48481
   884
  description {*
wenzelm@48481
   885
    Author:     Cezary Kaliszyk and Christian Urban
wenzelm@48481
   886
  *}
wenzelm@48483
   887
  options [document = false]
wenzelm@48481
   888
  theories
wenzelm@48481
   889
    DList
wenzelm@48481
   890
    FSet
wenzelm@48481
   891
    Quotient_Int
wenzelm@48481
   892
    Quotient_Message
wenzelm@48481
   893
    Lift_FSet
wenzelm@48481
   894
    Lift_Set
wenzelm@48481
   895
    Lift_Fun
wenzelm@48481
   896
    Quotient_Rat
wenzelm@48481
   897
    Lift_DList
wenzelm@48481
   898
wenzelm@48738
   899
session "HOL-Predicate_Compile_Examples" in Predicate_Compile_Examples = HOL +
wenzelm@48483
   900
  options [document = false]
wenzelm@48690
   901
  theories
wenzelm@48481
   902
    Examples
wenzelm@48481
   903
    Predicate_Compile_Tests
wenzelm@48690
   904
    (* FIXME
wenzelm@48690
   905
    Predicate_Compile_Quickcheck_Examples  -- should be added again soon (since 21-Oct-2010) *)
wenzelm@48481
   906
    Specialisation_Examples
wenzelm@48690
   907
    (* FIXME since 21-Jul-2011
wenzelm@48690
   908
    Hotel_Example_Small_Generator
wenzelm@48690
   909
    IMP_1
wenzelm@48690
   910
    IMP_2
wenzelm@48690
   911
    IMP_3
wenzelm@48690
   912
    IMP_4 *)
wenzelm@48690
   913
  theories [condition = "ISABELLE_SWIPL"]  (* FIXME: *or* ISABELLE_YAP (??) *)
wenzelm@48690
   914
    Code_Prolog_Examples
wenzelm@48690
   915
    Context_Free_Grammar_Example
wenzelm@48690
   916
    Hotel_Example_Prolog
wenzelm@48690
   917
    Lambda_Example
wenzelm@48690
   918
    List_Examples
wenzelm@48690
   919
  theories [condition = "ISABELLE_SWIPL", quick_and_dirty]  (* FIXME: *or* ISABELLE_YAP (??) *)
wenzelm@48690
   920
    Reg_Exp_Example
wenzelm@48481
   921
wenzelm@48738
   922
session HOLCF (main) in HOLCF = HOL +
wenzelm@48338
   923
  description {*
wenzelm@48338
   924
    Author:     Franz Regensburger
wenzelm@48338
   925
    Author:     Brian Huffman
wenzelm@48338
   926
wenzelm@48338
   927
    HOLCF -- a semantic extension of HOL by the LCF logic.
wenzelm@48338
   928
  *}
wenzelm@48338
   929
  options [document_graph]
wenzelm@48470
   930
  theories [document = false]
wenzelm@48338
   931
    "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48338
   932
    "~~/src/HOL/Library/Countable"
wenzelm@48481
   933
  theories
wenzelm@48481
   934
    Plain_HOLCF
wenzelm@48481
   935
    Fixrec
wenzelm@48481
   936
    HOLCF
wenzelm@48481
   937
  files "document/root.tex"
wenzelm@48481
   938
wenzelm@48738
   939
session "HOLCF-Tutorial" in "HOLCF/Tutorial" = HOLCF +
wenzelm@48481
   940
  theories
wenzelm@48481
   941
    Domain_ex
wenzelm@48481
   942
    Fixrec_ex
wenzelm@48481
   943
    New_Domain
wenzelm@48481
   944
  files "document/root.tex"
wenzelm@48481
   945
wenzelm@48738
   946
session "HOLCF-Library" in "HOLCF/Library" = HOLCF +
wenzelm@48483
   947
  options [document = false]
wenzelm@48481
   948
  theories HOLCF_Library
wenzelm@48481
   949
wenzelm@48738
   950
session "HOLCF-IMP" in "HOLCF/IMP" = HOLCF +
wenzelm@51403
   951
  description {*
wenzelm@51403
   952
    IMP -- A WHILE-language and its Semantics.
wenzelm@51403
   953
wenzelm@51403
   954
    This is the HOLCF-based denotational semantics of a simple WHILE-language.
wenzelm@51403
   955
  *}
wenzelm@48483
   956
  options [document = false]
wenzelm@48481
   957
  theories HoareEx
wenzelm@48338
   958
  files "document/root.tex"
wenzelm@48338
   959
wenzelm@48738
   960
session "HOLCF-ex" in "HOLCF/ex" = HOLCF +
wenzelm@48481
   961
  description {* Misc HOLCF examples *}
wenzelm@48483
   962
  options [document = false]
wenzelm@48481
   963
  theories
wenzelm@48481
   964
    Dnat
wenzelm@48481
   965
    Dagstuhl
wenzelm@48481
   966
    Focus_ex
wenzelm@48481
   967
    Fix2
wenzelm@48481
   968
    Hoare
wenzelm@48481
   969
    Concurrency_Monad
wenzelm@48481
   970
    Loop
wenzelm@48481
   971
    Powerdomain_ex
wenzelm@48481
   972
    Domain_Proofs
wenzelm@48481
   973
    Letrec
wenzelm@48481
   974
    Pattern_Match
wenzelm@48481
   975
wenzelm@48738
   976
session "HOLCF-FOCUS" in "HOLCF/FOCUS" = HOLCF +
wenzelm@51403
   977
  description {*
wenzelm@51403
   978
    FOCUS: a theory of stream-processing functions Isabelle/HOLCF.
wenzelm@51403
   979
wenzelm@51403
   980
    For introductions to FOCUS, see
wenzelm@51403
   981
wenzelm@51403
   982
    "The Design of Distributed Systems - An Introduction to FOCUS"
wenzelm@51403
   983
    http://www4.in.tum.de/publ/html.php?e=2
wenzelm@51403
   984
wenzelm@51403
   985
    "Specification and Refinement of a Buffer of Length One"
wenzelm@51403
   986
    http://www4.in.tum.de/publ/html.php?e=15
wenzelm@51403
   987
wenzelm@51403
   988
    "Specification and Development of Interactive Systems: Focus on Streams,
wenzelm@51403
   989
    Interfaces, and Refinement" http://www4.in.tum.de/publ/html.php?e=321
wenzelm@51403
   990
  *}
wenzelm@48483
   991
  options [document = false]
wenzelm@48481
   992
  theories
wenzelm@48481
   993
    Fstreams
wenzelm@48481
   994
    FOCUS
wenzelm@48481
   995
    Buffer_adm
wenzelm@48481
   996
wenzelm@48738
   997
session IOA in "HOLCF/IOA" = HOLCF +
wenzelm@48481
   998
  description {*
wenzelm@48481
   999
    Author:     Olaf Mueller
wenzelm@51403
  1000
    Copyright   1997 TU München
wenzelm@48481
  1001
wenzelm@51403
  1002
    A formalization of I/O automata in HOLCF.
wenzelm@51403
  1003
wenzelm@51403
  1004
    The distribution contains simulation relations, temporal logic, and an
wenzelm@51403
  1005
    abstraction theory. Everything is based upon a domain-theoretic model of
wenzelm@51403
  1006
    finite and infinite sequences.
wenzelm@48481
  1007
  *}
wenzelm@48483
  1008
  options [document = false]
wenzelm@48481
  1009
  theories "meta_theory/Abstraction"
wenzelm@48481
  1010
wenzelm@48738
  1011
session "IOA-ABP" in "HOLCF/IOA/ABP" = IOA +
wenzelm@48481
  1012
  description {*
wenzelm@48481
  1013
    Author:     Olaf Mueller
wenzelm@48481
  1014
wenzelm@48481
  1015
    The Alternating Bit Protocol performed in I/O-Automata.
wenzelm@48481
  1016
  *}
wenzelm@48483
  1017
  options [document = false]
wenzelm@48481
  1018
  theories Correctness
wenzelm@48481
  1019
wenzelm@48738
  1020
session "IOA-NTP" in "HOLCF/IOA/NTP" = IOA +
wenzelm@48481
  1021
  description {*
wenzelm@48481
  1022
    Author:     Tobias Nipkow & Konrad Slind
wenzelm@48481
  1023
wenzelm@48481
  1024
    A network transmission protocol, performed in the
wenzelm@48481
  1025
    I/O automata formalization by Olaf Mueller.
wenzelm@48481
  1026
  *}
wenzelm@48483
  1027
  options [document = false]
wenzelm@48481
  1028
  theories Correctness
wenzelm@48481
  1029
wenzelm@48738
  1030
session "IOA-Storage" in "HOLCF/IOA/Storage" = IOA +
wenzelm@48481
  1031
  description {*
wenzelm@48481
  1032
    Author:     Olaf Mueller
wenzelm@48481
  1033
wenzelm@48481
  1034
    Memory storage case study.
wenzelm@48481
  1035
  *}
wenzelm@48483
  1036
  options [document = false]
wenzelm@48481
  1037
  theories Correctness
wenzelm@48481
  1038
wenzelm@48738
  1039
session "IOA-ex" in "HOLCF/IOA/ex" = IOA +
wenzelm@48481
  1040
  description {*
wenzelm@48481
  1041
    Author:     Olaf Mueller
wenzelm@48481
  1042
  *}
wenzelm@48483
  1043
  options [document = false]
wenzelm@48481
  1044
  theories
wenzelm@48481
  1045
    TrivEx
wenzelm@48481
  1046
    TrivEx2
wenzelm@48481
  1047
wenzelm@48738
  1048
session "HOL-Datatype_Benchmark" in Datatype_Benchmark = HOL +
wenzelm@48481
  1049
  description {* Some rather large datatype examples (from John Harrison). *}
wenzelm@48483
  1050
  options [document = false]
wenzelm@48635
  1051
  theories [condition = ISABELLE_FULL_TEST, timing]
wenzelm@48481
  1052
    Brackin
wenzelm@48481
  1053
    Instructions
wenzelm@48481
  1054
    SML
wenzelm@48481
  1055
    Verilog
wenzelm@48481
  1056
wenzelm@48738
  1057
session "HOL-Record_Benchmark" in Record_Benchmark = HOL +
wenzelm@48481
  1058
  description {* Some benchmark on large record. *}
wenzelm@48483
  1059
  options [document = false]
wenzelm@48635
  1060
  theories [condition = ISABELLE_FULL_TEST, timing]
wenzelm@48481
  1061
    Record_Benchmark
wenzelm@48481
  1062