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