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