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