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