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