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