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