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