src/HOL/ROOT
author nipkow
Sat Jul 23 13:25:44 2016 +0200 (2016-07-23)
changeset 63538 d7b5e2a222c2
parent 63537 831816778409
child 63594 bd218a9320b5
permissions -rw-r--r--
added new vcg based on existentially quantified while-rule
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@51161
    42
    (*data refinements and dependent applications*)
haftmann@51161
    43
    AList_Mapping
haftmann@51161
    44
    Code_Binary_Nat
haftmann@51161
    45
    Code_Char
wenzelm@55447
    46
    Code_Prolog
wenzelm@48481
    47
    Code_Real_Approx_By_Float
haftmann@50023
    48
    Code_Target_Numeral
haftmann@51161
    49
    DAList
haftmann@54429
    50
    DAList_Multiset
haftmann@51161
    51
    RBT_Mapping
haftmann@51161
    52
    RBT_Set
haftmann@51161
    53
    (*legacy tools*)
blanchet@49985
    54
    Refute
blanchet@58372
    55
    Old_Datatype
haftmann@51161
    56
    Old_Recdef
blanchet@58110
    57
    Old_SMT
wenzelm@56781
    58
  document_files "root.bib" "root.tex"
wenzelm@48481
    59
wenzelm@48738
    60
session "HOL-Hahn_Banach" in Hahn_Banach = HOL +
wenzelm@48481
    61
  description {*
wenzelm@48481
    62
    Author:     Gertrud Bauer, TU Munich
wenzelm@48481
    63
wenzelm@48481
    64
    The Hahn-Banach theorem for real vector spaces.
wenzelm@51403
    65
wenzelm@51403
    66
    This is the proof of the Hahn-Banach theorem for real vectorspaces,
wenzelm@51403
    67
    following H. Heuser, Funktionalanalysis, p. 228 -232. The Hahn-Banach
blanchet@55018
    68
    theorem is one of the fundamental theorems of functional analysis. It is a
wenzelm@51403
    69
    conclusion of Zorn's lemma.
wenzelm@51403
    70
wenzelm@51403
    71
    Two different formaulations of the theorem are presented, one for general
wenzelm@51403
    72
    real vectorspaces and its application to normed vectorspaces.
wenzelm@51403
    73
wenzelm@51403
    74
    The theorem says, that every continous linearform, defined on arbitrary
wenzelm@51403
    75
    subspaces (not only one-dimensional subspaces), can be extended to a
wenzelm@51403
    76
    continous linearform on the whole vectorspace.
wenzelm@48481
    77
  *}
wenzelm@48481
    78
  theories Hahn_Banach
wenzelm@56781
    79
  document_files "root.bib" "root.tex"
wenzelm@48481
    80
wenzelm@48738
    81
session "HOL-Induct" in Induct = HOL +
wenzelm@51403
    82
  description {*
wenzelm@51403
    83
    Examples of (Co)Inductive Definitions.
wenzelm@51403
    84
wenzelm@51403
    85
    Comb proves the Church-Rosser theorem for combinators (see
wenzelm@51403
    86
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz).
wenzelm@51403
    87
wenzelm@51403
    88
    Mutil is the famous Mutilated Chess Board problem (see
wenzelm@51403
    89
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR394-lcp-mutilated-chess-board.dvi.gz).
wenzelm@51403
    90
wenzelm@51403
    91
    PropLog proves the completeness of a formalization of propositional logic
wenzelm@51403
    92
    (see
blanchet@58372
    93
    http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz).
wenzelm@51403
    94
wenzelm@51403
    95
    Exp demonstrates the use of iterated inductive definitions to reason about
wenzelm@51403
    96
    mutually recursive relations.
wenzelm@51403
    97
  *}
blanchet@58372
    98
  theories [document = false]
blanchet@58372
    99
    "~~/src/HOL/Library/Old_Datatype"
wenzelm@48481
   100
  theories [quick_and_dirty]
wenzelm@48481
   101
    Common_Patterns
wenzelm@48481
   102
  theories
wenzelm@61935
   103
    Nested_Datatype
wenzelm@48481
   104
    QuoDataType
wenzelm@48481
   105
    QuoNestedDataType
wenzelm@48481
   106
    Term
wenzelm@48481
   107
    SList
wenzelm@48481
   108
    ABexp
wenzelm@48481
   109
    Tree
wenzelm@48481
   110
    Ordinals
wenzelm@48481
   111
    Sigma_Algebra
wenzelm@48481
   112
    Comb
wenzelm@48481
   113
    PropLog
wenzelm@48481
   114
    Com
wenzelm@56781
   115
  document_files "root.tex"
wenzelm@48481
   116
wenzelm@48738
   117
session "HOL-IMP" in IMP = HOL +
wenzelm@59446
   118
  options [document_variants = document]
wenzelm@48481
   119
  theories [document = false]
wenzelm@48481
   120
    "~~/src/HOL/Library/While_Combinator"
wenzelm@48481
   121
    "~~/src/HOL/Library/Char_ord"
wenzelm@48481
   122
    "~~/src/HOL/Library/List_lexord"
nipkow@51625
   123
    "~~/src/HOL/Library/Quotient_List"
nipkow@51625
   124
    "~~/src/HOL/Library/Extended"
wenzelm@48481
   125
  theories
wenzelm@48481
   126
    BExp
wenzelm@48481
   127
    ASM
nipkow@50050
   128
    Finite_Reachable
nipkow@52394
   129
    Denotational
nipkow@52400
   130
    Compiler2
wenzelm@48481
   131
    Poly_Types
wenzelm@48481
   132
    Sec_Typing
wenzelm@48481
   133
    Sec_TypingT
nipkow@52726
   134
    Def_Init_Big
nipkow@52726
   135
    Def_Init_Small
nipkow@52726
   136
    Fold
wenzelm@48481
   137
    Live
wenzelm@48481
   138
    Live_True
wenzelm@48481
   139
    Hoare_Examples
nipkow@63538
   140
    Hoare_Sound_Complete
nipkow@52269
   141
    VCG
nipkow@52282
   142
    Hoare_Total
nipkow@63538
   143
    VCG_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/Library/State_Monad"
wenzelm@48481
   421
  theories
wenzelm@48481
   422
    Greatest_Common_Divisor
wenzelm@48481
   423
    Warshall
wenzelm@48481
   424
    Higman_Extraction
wenzelm@48481
   425
    Pigeonhole
wenzelm@48481
   426
    Euclid
wenzelm@56781
   427
  document_files "root.bib" "root.tex"
wenzelm@48481
   428
lars@63000
   429
session "HOL-Proofs-Lambda" in "Proofs/Lambda" = "HOL-Proofs" +
wenzelm@51403
   430
  description {*
wenzelm@51403
   431
    Lambda Calculus in de Bruijn's Notation.
wenzelm@51403
   432
wenzelm@51403
   433
    This session defines lambda-calculus terms with de Bruijn indixes and
wenzelm@51403
   434
    proves confluence of beta, eta and beta+eta.
wenzelm@51403
   435
wenzelm@51403
   436
    The paper "More Church-Rosser Proofs (in Isabelle/HOL)" describes the whole
wenzelm@51403
   437
    theory (see http://www.in.tum.de/~nipkow/pubs/jar2001.html).
wenzelm@51403
   438
  *}
wenzelm@62354
   439
  options [print_mode = "no_brackets",
wenzelm@62242
   440
    parallel_proofs = 0, quick_and_dirty = false]
wenzelm@48481
   441
  theories [document = false]
haftmann@51143
   442
    "~~/src/HOL/Library/Code_Target_Int"
wenzelm@48481
   443
  theories
wenzelm@48481
   444
    Eta
wenzelm@48481
   445
    StrongNorm
wenzelm@48481
   446
    Standardization
wenzelm@48481
   447
    WeakNorm
wenzelm@56781
   448
  document_files "root.bib" "root.tex"
wenzelm@48481
   449
wenzelm@48738
   450
session "HOL-Prolog" in Prolog = HOL +
wenzelm@48481
   451
  description {*
wenzelm@48481
   452
    Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
wenzelm@51403
   453
wenzelm@51403
   454
    A bare-bones implementation of Lambda-Prolog.
wenzelm@51403
   455
wenzelm@51403
   456
    This is a simple exploratory implementation of Lambda-Prolog in HOL,
wenzelm@51403
   457
    including some minimal examples (in Test.thy) and a more typical example of
wenzelm@51403
   458
    a little functional language and its type system.
wenzelm@48481
   459
  *}
wenzelm@48483
   460
  options [document = false]
wenzelm@48481
   461
  theories Test Type
wenzelm@48481
   462
wenzelm@48738
   463
session "HOL-MicroJava" in MicroJava = HOL +
wenzelm@51403
   464
  description {*
wenzelm@51403
   465
    Formalization of a fragment of Java, together with a corresponding virtual
wenzelm@51403
   466
    machine and a specification of its bytecode verifier and a lightweight
wenzelm@51403
   467
    bytecode verifier, including proofs of type-safety.
wenzelm@51403
   468
  *}
wenzelm@59446
   469
  theories [document = false]
wenzelm@59446
   470
    "~~/src/HOL/Library/While_Combinator"
wenzelm@59446
   471
  theories
wenzelm@59446
   472
    MicroJava
wenzelm@56781
   473
  document_files
wenzelm@56781
   474
    "introduction.tex"
wenzelm@56781
   475
    "root.bib"
wenzelm@56781
   476
    "root.tex"
wenzelm@48481
   477
wenzelm@48738
   478
session "HOL-NanoJava" in NanoJava = HOL +
wenzelm@51403
   479
  description {*
wenzelm@51403
   480
    Hoare Logic for a tiny fragment of Java.
wenzelm@51403
   481
  *}
wenzelm@48481
   482
  theories Example
wenzelm@56781
   483
  document_files "root.bib" "root.tex"
wenzelm@48481
   484
wenzelm@48738
   485
session "HOL-Bali" in Bali = HOL +
wenzelm@48481
   486
  theories
wenzelm@48481
   487
    AxExample
wenzelm@48481
   488
    AxSound
wenzelm@48481
   489
    AxCompl
wenzelm@48481
   490
    Trans
wenzelm@60751
   491
    TypeSafe
wenzelm@56781
   492
  document_files "root.tex"
wenzelm@48481
   493
wenzelm@48738
   494
session "HOL-IOA" in IOA = HOL +
wenzelm@48481
   495
  description {*
wenzelm@51403
   496
    Author:     Tobias Nipkow and Konrad Slind and Olaf Müller
wenzelm@51403
   497
    Copyright   1994--1996  TU Muenchen
wenzelm@48481
   498
blanchet@55417
   499
    The meta-theory of I/O-Automata in HOL. This formalization has been
wenzelm@51403
   500
    significantly changed and extended, see HOLCF/IOA. There are also the
wenzelm@51403
   501
    proofs of two communication protocols which formerly have been here.
wenzelm@48481
   502
wenzelm@48481
   503
    @inproceedings{Nipkow-Slind-IOA,
wenzelm@48481
   504
    author={Tobias Nipkow and Konrad Slind},
wenzelm@48481
   505
    title={{I/O} Automata in {Isabelle/HOL}},
wenzelm@48481
   506
    booktitle={Proc.\ TYPES Workshop 1994},
wenzelm@48481
   507
    publisher=Springer,
wenzelm@48481
   508
    series=LNCS,
wenzelm@48481
   509
    note={To appear}}
wenzelm@48481
   510
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/ioa.ps.gz
wenzelm@48481
   511
wenzelm@48481
   512
    and
wenzelm@48481
   513
wenzelm@48481
   514
    @inproceedings{Mueller-Nipkow,
wenzelm@48481
   515
    author={Olaf M\"uller and Tobias Nipkow},
wenzelm@48481
   516
    title={Combining Model Checking and Deduction for {I/O}-Automata},
wenzelm@48481
   517
    booktitle={Proc.\ TACAS Workshop},
wenzelm@48481
   518
    organization={Aarhus University, BRICS report},
wenzelm@48481
   519
    year=1995}
wenzelm@48481
   520
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/tacas.dvi.gz
wenzelm@48481
   521
  *}
wenzelm@48483
   522
  options [document = false]
wenzelm@48481
   523
  theories Solve
wenzelm@48481
   524
wenzelm@48738
   525
session "HOL-Lattice" in Lattice = HOL +
wenzelm@48481
   526
  description {*
wenzelm@48481
   527
    Author:     Markus Wenzel, TU Muenchen
wenzelm@48481
   528
wenzelm@48481
   529
    Basic theory of lattices and orders.
wenzelm@48481
   530
  *}
wenzelm@48481
   531
  theories CompleteLattice
wenzelm@56781
   532
  document_files "root.tex"
wenzelm@48481
   533
wenzelm@48738
   534
session "HOL-ex" in ex = HOL +
wenzelm@51421
   535
  description {*
wenzelm@51421
   536
    Miscellaneous examples for Higher-Order Logic.
wenzelm@51421
   537
  *}
wenzelm@48481
   538
  theories [document = false]
wenzelm@48481
   539
    "~~/src/HOL/Library/State_Monad"
haftmann@50023
   540
    Code_Binary_Nat_examples
wenzelm@48481
   541
    "~~/src/HOL/Library/FuncSet"
wenzelm@48481
   542
    Eval_Examples
wenzelm@48481
   543
    Normalization_by_Evaluation
wenzelm@48481
   544
    Hebrew
wenzelm@48481
   545
    Chinese
wenzelm@48481
   546
    Serbian
blanchet@49985
   547
    "~~/src/HOL/Library/Refute"
haftmann@56922
   548
    "~~/src/HOL/Library/Transitive_Closure_Table"
wenzelm@55123
   549
    Cartouche_Examples
wenzelm@48481
   550
  theories
wenzelm@59090
   551
    Commands
wenzelm@57507
   552
    Adhoc_Overloading_Examples
wenzelm@48481
   553
    Iff_Oracle
wenzelm@48481
   554
    Coercion_Examples
wenzelm@48481
   555
    Abstract_NAT
wenzelm@48481
   556
    Guess
wenzelm@62999
   557
    Functions
wenzelm@48481
   558
    Induction_Schema
wenzelm@48481
   559
    LocaleTest2
wenzelm@48481
   560
    Records
wenzelm@48481
   561
    While_Combinator_Example
wenzelm@48481
   562
    MonoidGroup
wenzelm@48481
   563
    BinEx
wenzelm@48481
   564
    Hex_Bin_Examples
wenzelm@48481
   565
    Antiquote
wenzelm@48481
   566
    Multiquote
wenzelm@48481
   567
    PER
wenzelm@48481
   568
    NatSum
wenzelm@48481
   569
    ThreeDivides
kleing@59190
   570
    Cubic_Quartic
noschinl@59739
   571
    Pythagoras
wenzelm@48481
   572
    Intuitionistic
wenzelm@48481
   573
    CTL
wenzelm@48481
   574
    Arith_Examples
wenzelm@48481
   575
    Tree23
nipkow@58644
   576
    Bubblesort
wenzelm@48481
   577
    MergeSort
wenzelm@48481
   578
    Lagrange
wenzelm@48481
   579
    Groebner_Examples
wenzelm@48481
   580
    Unification
wenzelm@48481
   581
    Primrec
wenzelm@48481
   582
    Tarski
wenzelm@48481
   583
    Classical
wenzelm@48481
   584
    Set_Theory
wenzelm@48481
   585
    Termination
wenzelm@48481
   586
    Coherent
wenzelm@48481
   587
    PresburgerEx
haftmann@51093
   588
    Reflection_Examples
wenzelm@48481
   589
    Sqrt
wenzelm@48481
   590
    Sqrt_Script
kuncar@61368
   591
    Transfer_Debug
wenzelm@48481
   592
    Transfer_Ex
wenzelm@48481
   593
    Transfer_Int_Nat
haftmann@56922
   594
    Transitive_Closure_Table_Ex
wenzelm@48481
   595
    HarmonicSeries
wenzelm@48481
   596
    Refute_Examples
wenzelm@48481
   597
    Execute_Choice
wenzelm@48481
   598
    Gauge_Integration
wenzelm@48481
   599
    Dedekind_Real
wenzelm@48481
   600
    Quicksort
wenzelm@48481
   601
    Birthday_Paradox
wenzelm@48481
   602
    List_to_Set_Comprehension_Examples
wenzelm@48481
   603
    Seq
wenzelm@48481
   604
    Simproc_Tests
wenzelm@48481
   605
    Executable_Relation
wenzelm@48481
   606
    FinFunPred
wenzelm@55663
   607
    Set_Comprehension_Pointfree_Examples
wenzelm@48481
   608
    Parallel_Example
nipkow@50138
   609
    IArray_Examples
noschinl@53430
   610
    Simps_Case_Conv_Examples
wenzelm@53935
   611
    ML
noschinl@59739
   612
    Rewrite_Examples
boehmes@56815
   613
    SAT_Examples
wenzelm@58630
   614
    SOS
wenzelm@58418
   615
    SOS_Cert
bulwahn@60603
   616
    Ballot
bulwahn@60603
   617
    Erdoes_Szekeres
bulwahn@60603
   618
    Sum_of_Powers
wenzelm@62285
   619
    Sudoku
haftmann@63165
   620
    Code_Timing
haftmann@63375
   621
    Perm_Fragments
wenzelm@51558
   622
  theories [skip_proofs = false]
wenzelm@51558
   623
    Meson_Test
wenzelm@56781
   624
  document_files "root.bib" "root.tex"
wenzelm@48481
   625
wenzelm@48738
   626
session "HOL-Isar_Examples" in Isar_Examples = HOL +
wenzelm@51403
   627
  description {*
wenzelm@61935
   628
    Miscellaneous Isabelle/Isar examples.
wenzelm@51403
   629
  *}
wenzelm@61939
   630
  options [quick_and_dirty]
wenzelm@48481
   631
  theories [document = false]
wenzelm@48481
   632
    "~~/src/HOL/Library/Lattice_Syntax"
wenzelm@48481
   633
    "../Number_Theory/Primes"
wenzelm@48481
   634
  theories
wenzelm@61939
   635
    Knaster_Tarski
wenzelm@61939
   636
    Peirce
wenzelm@61939
   637
    Drinker
wenzelm@48481
   638
    Cantor
wenzelm@61938
   639
    Schroeder_Bernstein
wenzelm@61939
   640
    Structured_Statements
wenzelm@61939
   641
    Basic_Logic
wenzelm@48481
   642
    Expr_Compiler
wenzelm@48481
   643
    Fibonacci
wenzelm@48481
   644
    Group
wenzelm@48481
   645
    Group_Context
wenzelm@48481
   646
    Group_Notepad
wenzelm@48481
   647
    Hoare_Ex
wenzelm@48481
   648
    Mutilated_Checkerboard
wenzelm@48481
   649
    Puzzle
wenzelm@48481
   650
    Summation
wenzelm@61935
   651
    First_Order_Logic
wenzelm@61935
   652
    Higher_Order_Logic
wenzelm@56781
   653
  document_files
wenzelm@56781
   654
    "root.bib"
wenzelm@56781
   655
    "root.tex"
wenzelm@48481
   656
wenzelm@60119
   657
session "HOL-Eisbach" in Eisbach = HOL +
wenzelm@60119
   658
  description {*
wenzelm@60119
   659
    The Eisbach proof method language and "match" method.
wenzelm@60119
   660
  *}
wenzelm@60119
   661
  theories
wenzelm@60119
   662
    Eisbach
wenzelm@60119
   663
    Tests
wenzelm@60119
   664
    Examples
wenzelm@62168
   665
    Examples_FOL
wenzelm@60119
   666
wenzelm@48738
   667
session "HOL-SET_Protocol" in SET_Protocol = HOL +
wenzelm@51403
   668
  description {*
wenzelm@51403
   669
    Verification of the SET Protocol.
wenzelm@51403
   670
  *}
wenzelm@48481
   671
  theories [document = false] "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48481
   672
  theories SET_Protocol
wenzelm@56781
   673
  document_files "root.tex"
wenzelm@48481
   674
wenzelm@48738
   675
session "HOL-Matrix_LP" in Matrix_LP = HOL +
wenzelm@51403
   676
  description {*
wenzelm@51403
   677
    Two-dimensional matrices and linear programming.
wenzelm@51403
   678
  *}
wenzelm@48481
   679
  theories Cplex
wenzelm@56781
   680
  document_files "root.tex"
wenzelm@48481
   681
wenzelm@48738
   682
session "HOL-TLA" in TLA = HOL +
wenzelm@51403
   683
  description {*
wenzelm@51403
   684
    Lamport's Temporal Logic of Actions.
wenzelm@51403
   685
  *}
wenzelm@48483
   686
  options [document = false]
wenzelm@48481
   687
  theories TLA
wenzelm@48481
   688
wenzelm@48738
   689
session "HOL-TLA-Inc" in "TLA/Inc" = "HOL-TLA" +
wenzelm@48483
   690
  options [document = false]
wenzelm@48481
   691
  theories Inc
wenzelm@48481
   692
wenzelm@48738
   693
session "HOL-TLA-Buffer" in "TLA/Buffer" = "HOL-TLA" +
wenzelm@48483
   694
  options [document = false]
wenzelm@48481
   695
  theories DBuffer
wenzelm@48481
   696
wenzelm@48738
   697
session "HOL-TLA-Memory" in "TLA/Memory" = "HOL-TLA" +
wenzelm@48483
   698
  options [document = false]
wenzelm@48481
   699
  theories MemoryImplementation
wenzelm@48481
   700
wenzelm@48738
   701
session "HOL-TPTP" in TPTP = HOL +
wenzelm@48481
   702
  description {*
wenzelm@48481
   703
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   704
    Author:     Nik Sultana, University of Cambridge
wenzelm@48481
   705
    Copyright   2011
wenzelm@48481
   706
wenzelm@48481
   707
    TPTP-related extensions.
wenzelm@48481
   708
  *}
wenzelm@62354
   709
  options [document = false]
wenzelm@48481
   710
  theories
wenzelm@48481
   711
    ATP_Theory_Export
wenzelm@48481
   712
    MaSh_Eval
wenzelm@48481
   713
    TPTP_Interpret
wenzelm@48481
   714
    THF_Arith
sultana@55596
   715
    TPTP_Proof_Reconstruction
wenzelm@52488
   716
  theories
wenzelm@48481
   717
    ATP_Problem_Import
wenzelm@48481
   718
wenzelm@50844
   719
session "HOL-Multivariate_Analysis" (main) in Multivariate_Analysis = HOL +
wenzelm@48481
   720
  theories
wenzelm@48481
   721
    Multivariate_Analysis
wenzelm@48481
   722
    Determinants
lp15@56215
   723
    PolyRoots
lp15@63078
   724
    Polytope
lp15@56215
   725
    Complex_Analysis_Basics
lp15@59741
   726
    Complex_Transcendental
lp15@60809
   727
    Cauchy_Integral_Thm
wenzelm@56781
   728
  document_files
wenzelm@56781
   729
    "root.tex"
wenzelm@48481
   730
wenzelm@59922
   731
session "HOL-Multivariate_Analysis-ex" in "Multivariate_Analysis/ex" = "HOL-Multivariate_Analysis" +
wenzelm@59922
   732
  theories
wenzelm@59922
   733
    Approximations
wenzelm@59922
   734
wenzelm@48738
   735
session "HOL-Probability" in "Probability" = "HOL-Multivariate_Analysis" +
wenzelm@48481
   736
  theories [document = false]
wenzelm@48481
   737
    "~~/src/HOL/Library/Countable"
wenzelm@48481
   738
    "~~/src/HOL/Library/Permutation"
hoelzl@56994
   739
    "~~/src/HOL/Library/Order_Continuity"
hoelzl@56994
   740
    "~~/src/HOL/Library/Diagonal_Subsequence"
wenzelm@48481
   741
  theories
wenzelm@48481
   742
    Probability
wenzelm@56781
   743
  document_files "root.tex"
wenzelm@48481
   744
haftmann@61946
   745
session "HOL-Probability-ex" in "Probability/ex" = "HOL-Probability" +
haftmann@61946
   746
  theories
haftmann@61946
   747
    "Dining_Cryptographers"
haftmann@61946
   748
    "Koepf_Duermuth_Countermeasure"
haftmann@61946
   749
    "Measure_Not_CCC"
haftmann@61946
   750
wenzelm@59898
   751
session "HOL-Nominal" in Nominal = HOL +
wenzelm@48483
   752
  options [document = false]
wenzelm@48481
   753
  theories Nominal
wenzelm@48481
   754
wenzelm@48738
   755
session "HOL-Nominal-Examples" in "Nominal/Examples" = "HOL-Nominal" +
wenzelm@62354
   756
  options [document = false]
blanchet@58329
   757
  theories
wenzelm@59162
   758
    Class3
wenzelm@59162
   759
    CK_Machine
wenzelm@59162
   760
    Compile
wenzelm@59162
   761
    Contexts
wenzelm@59162
   762
    Crary
wenzelm@59162
   763
    CR_Takahashi
wenzelm@59162
   764
    CR
wenzelm@59162
   765
    Fsub
wenzelm@59162
   766
    Height
wenzelm@59162
   767
    Lambda_mu
wenzelm@59162
   768
    Lam_Funs
wenzelm@59162
   769
    LocalWeakening
wenzelm@59162
   770
    Pattern
wenzelm@59162
   771
    SN
wenzelm@59162
   772
    SOS
wenzelm@59162
   773
    Standardization
wenzelm@59162
   774
    Support
wenzelm@59162
   775
    Type_Preservation
wenzelm@59162
   776
    Weakening
wenzelm@59162
   777
    W
blanchet@58329
   778
  theories [quick_and_dirty]
blanchet@58329
   779
    VC_Condition
wenzelm@48481
   780
blanchet@55054
   781
session "HOL-Cardinals" in Cardinals = HOL +
wenzelm@51421
   782
  description {*
wenzelm@51421
   783
    Ordinals and Cardinals, Full Theories.
wenzelm@51421
   784
  *}
blanchet@49511
   785
  options [document = false]
traytel@59747
   786
  theories
traytel@59747
   787
    Cardinals
traytel@59747
   788
    Bounded_Set
wenzelm@56781
   789
  document_files
wenzelm@56781
   790
    "intro.tex"
wenzelm@56781
   791
    "root.tex"
wenzelm@56781
   792
    "root.bib"
blanchet@48975
   793
blanchet@58309
   794
session "HOL-Datatype_Examples" in Datatype_Examples = HOL +
wenzelm@51421
   795
  description {*
wenzelm@62286
   796
    (Co)datatype Examples.
wenzelm@51421
   797
  *}
wenzelm@49932
   798
  options [document = false]
blanchet@48975
   799
  theories
blanchet@56454
   800
    Compat
blanchet@48975
   801
    Lambda_Term
blanchet@48975
   802
    Process
blanchet@48975
   803
    TreeFsetI
popescua@49872
   804
    "Derivation_Trees/Gram_Lang"
popescua@49872
   805
    "Derivation_Trees/Parallel"
traytel@50517
   806
    Koenig
traytel@60921
   807
    Lift_BNF
traytel@61745
   808
    Milner_Tofte
traytel@54961
   809
    Stream_Processor
blanchet@53122
   810
    Misc_Codatatype
blanchet@53122
   811
    Misc_Datatype
blanchet@54193
   812
    Misc_Primcorec
blanchet@53306
   813
    Misc_Primrec
blanchet@48975
   814
blanchet@62694
   815
session "HOL-Corec_Examples" in Corec_Examples = HOL +
blanchet@62694
   816
  description {*
blanchet@62694
   817
    Corecursion Examples.
blanchet@62694
   818
  *}
blanchet@62694
   819
  options [document = false]
blanchet@62694
   820
  theories
blanchet@62694
   821
    LFilter
blanchet@62734
   822
    Paper_Examples
blanchet@62694
   823
    Stream_Processor
blanchet@62696
   824
    "Tests/Simple_Nesting"
blanchet@62696
   825
  theories [quick_and_dirty]
blanchet@62696
   826
    "Tests/GPV_Bare_Bones"
blanchet@62696
   827
    "Tests/Merge_D"
blanchet@62696
   828
    "Tests/Merge_Poly"
blanchet@62696
   829
    "Tests/Misc_Mono"
blanchet@62696
   830
    "Tests/Misc_Poly"
blanchet@62696
   831
    "Tests/Small_Concrete"
blanchet@62725
   832
    "Tests/Stream_Friends"
blanchet@62696
   833
    "Tests/TLList_Friends"
blanchet@63190
   834
    "Tests/Type_Class"
blanchet@62694
   835
wenzelm@50844
   836
session "HOL-Word" (main) in Word = HOL +
wenzelm@48481
   837
  theories Word
wenzelm@56781
   838
  document_files "root.bib" "root.tex"
wenzelm@48481
   839
wenzelm@48738
   840
session "HOL-Word-Examples" in "Word/Examples" = "HOL-Word" +
wenzelm@48483
   841
  options [document = false]
wenzelm@48481
   842
  theories WordExamples
wenzelm@48481
   843
wenzelm@48738
   844
session "HOL-Statespace" in Statespace = HOL +
wenzelm@51558
   845
  theories [skip_proofs = false]
wenzelm@51558
   846
    StateSpaceEx
wenzelm@56781
   847
  document_files "root.tex"
wenzelm@48481
   848
wenzelm@62479
   849
session "HOL-Nonstandard_Analysis" in Nonstandard_Analysis = HOL +
wenzelm@51421
   850
  description {*
wenzelm@51421
   851
    Nonstandard analysis.
wenzelm@51421
   852
  *}
wenzelm@62479
   853
  theories
wenzelm@62479
   854
    Nonstandard_Analysis
wenzelm@56781
   855
  document_files "root.tex"
wenzelm@48481
   856
wenzelm@62479
   857
session "HOL-Nonstandard_Analysis-Examples" in "Nonstandard_Analysis/Examples" = "HOL-Nonstandard_Analysis" +
wenzelm@48483
   858
  options [document = false]
wenzelm@48481
   859
  theories NSPrimes
wenzelm@48481
   860
wenzelm@48738
   861
session "HOL-Mirabelle" in Mirabelle = HOL +
wenzelm@48483
   862
  options [document = false]
wenzelm@48481
   863
  theories Mirabelle_Test
wenzelm@48589
   864
wenzelm@48738
   865
session "HOL-Mirabelle-ex" in "Mirabelle/ex" = "HOL-Mirabelle" +
wenzelm@62354
   866
  options [document = false, timeout = 60]
wenzelm@49448
   867
  theories Ex
wenzelm@48481
   868
wenzelm@48738
   869
session "HOL-Word-SMT_Examples" in SMT_Examples = "HOL-Word" +
wenzelm@62354
   870
  options [document = false, quick_and_dirty]
wenzelm@48481
   871
  theories
boehmes@52722
   872
    Boogie
wenzelm@48481
   873
    SMT_Examples
wenzelm@48481
   874
    SMT_Word_Examples
blanchet@50666
   875
    SMT_Tests
wenzelm@48481
   876
  files
blanchet@58367
   877
    "Boogie_Dijkstra.certs"
blanchet@58367
   878
    "Boogie_Max.certs"
blanchet@58367
   879
    "SMT_Examples.certs"
blanchet@58367
   880
    "SMT_Word_Examples.certs"
blanchet@58367
   881
    "VCC_Max.certs"
wenzelm@48481
   882
wenzelm@50844
   883
session "HOL-SPARK" (main) in "SPARK" = "HOL-Word" +
wenzelm@48483
   884
  options [document = false]
wenzelm@48481
   885
  theories SPARK
wenzelm@48481
   886
wenzelm@48738
   887
session "HOL-SPARK-Examples" in "SPARK/Examples" = "HOL-SPARK" +
wenzelm@59810
   888
  options [document = false, spark_prv = false]
wenzelm@48481
   889
  theories
wenzelm@48481
   890
    "Gcd/Greatest_Common_Divisor"
wenzelm@48481
   891
wenzelm@48481
   892
    "Liseq/Longest_Increasing_Subsequence"
wenzelm@48481
   893
wenzelm@48481
   894
    "RIPEMD-160/F"
wenzelm@48481
   895
    "RIPEMD-160/Hash"
wenzelm@48481
   896
    "RIPEMD-160/K_L"
wenzelm@48481
   897
    "RIPEMD-160/K_R"
wenzelm@48481
   898
    "RIPEMD-160/R_L"
wenzelm@48481
   899
    "RIPEMD-160/Round"
wenzelm@48481
   900
    "RIPEMD-160/R_R"
wenzelm@48481
   901
    "RIPEMD-160/S_L"
wenzelm@48481
   902
    "RIPEMD-160/S_R"
wenzelm@48481
   903
wenzelm@48481
   904
    "Sqrt/Sqrt"
wenzelm@48481
   905
  files
wenzelm@48481
   906
    "Gcd/greatest_common_divisor/g_c_d.fdl"
wenzelm@48481
   907
    "Gcd/greatest_common_divisor/g_c_d.rls"
wenzelm@48481
   908
    "Gcd/greatest_common_divisor/g_c_d.siv"
wenzelm@48481
   909
    "Liseq/liseq/liseq_length.fdl"
wenzelm@48481
   910
    "Liseq/liseq/liseq_length.rls"
wenzelm@48481
   911
    "Liseq/liseq/liseq_length.siv"
wenzelm@48481
   912
    "RIPEMD-160/rmd/f.fdl"
wenzelm@48481
   913
    "RIPEMD-160/rmd/f.rls"
wenzelm@48481
   914
    "RIPEMD-160/rmd/f.siv"
wenzelm@48481
   915
    "RIPEMD-160/rmd/hash.fdl"
wenzelm@48481
   916
    "RIPEMD-160/rmd/hash.rls"
wenzelm@48481
   917
    "RIPEMD-160/rmd/hash.siv"
wenzelm@48481
   918
    "RIPEMD-160/rmd/k_l.fdl"
wenzelm@48481
   919
    "RIPEMD-160/rmd/k_l.rls"
wenzelm@48481
   920
    "RIPEMD-160/rmd/k_l.siv"
wenzelm@48481
   921
    "RIPEMD-160/rmd/k_r.fdl"
wenzelm@48481
   922
    "RIPEMD-160/rmd/k_r.rls"
wenzelm@48481
   923
    "RIPEMD-160/rmd/k_r.siv"
wenzelm@48481
   924
    "RIPEMD-160/rmd/r_l.fdl"
wenzelm@48481
   925
    "RIPEMD-160/rmd/r_l.rls"
wenzelm@48481
   926
    "RIPEMD-160/rmd/r_l.siv"
wenzelm@48481
   927
    "RIPEMD-160/rmd/round.fdl"
wenzelm@48481
   928
    "RIPEMD-160/rmd/round.rls"
wenzelm@48481
   929
    "RIPEMD-160/rmd/round.siv"
wenzelm@48481
   930
    "RIPEMD-160/rmd/r_r.fdl"
wenzelm@48481
   931
    "RIPEMD-160/rmd/r_r.rls"
wenzelm@48481
   932
    "RIPEMD-160/rmd/r_r.siv"
wenzelm@48481
   933
    "RIPEMD-160/rmd/s_l.fdl"
wenzelm@48481
   934
    "RIPEMD-160/rmd/s_l.rls"
wenzelm@48481
   935
    "RIPEMD-160/rmd/s_l.siv"
wenzelm@48481
   936
    "RIPEMD-160/rmd/s_r.fdl"
wenzelm@48481
   937
    "RIPEMD-160/rmd/s_r.rls"
wenzelm@48481
   938
    "RIPEMD-160/rmd/s_r.siv"
wenzelm@48481
   939
wenzelm@48738
   940
session "HOL-SPARK-Manual" in "SPARK/Manual" = "HOL-SPARK" +
wenzelm@59810
   941
  options [show_question_marks = false, spark_prv = false]
wenzelm@48481
   942
  theories
wenzelm@48481
   943
    Example_Verification
wenzelm@48481
   944
    VC_Principles
wenzelm@48481
   945
    Reference
wenzelm@48481
   946
    Complex_Types
wenzelm@48481
   947
  files
wenzelm@48481
   948
    "complex_types_app/initialize.fdl"
wenzelm@48481
   949
    "complex_types_app/initialize.rls"
wenzelm@48481
   950
    "complex_types_app/initialize.siv"
wenzelm@48481
   951
    "loop_invariant/proc1.fdl"
wenzelm@48481
   952
    "loop_invariant/proc1.rls"
wenzelm@48481
   953
    "loop_invariant/proc1.siv"
wenzelm@48481
   954
    "loop_invariant/proc2.fdl"
wenzelm@48481
   955
    "loop_invariant/proc2.rls"
wenzelm@48481
   956
    "loop_invariant/proc2.siv"
wenzelm@48481
   957
    "simple_greatest_common_divisor/g_c_d.fdl"
wenzelm@48481
   958
    "simple_greatest_common_divisor/g_c_d.rls"
wenzelm@48481
   959
    "simple_greatest_common_divisor/g_c_d.siv"
wenzelm@56781
   960
  document_files
wenzelm@56781
   961
    "complex_types.ads"
wenzelm@56781
   962
    "complex_types_app.adb"
wenzelm@56781
   963
    "complex_types_app.ads"
wenzelm@56781
   964
    "Gcd.adb"
wenzelm@56781
   965
    "Gcd.ads"
wenzelm@56781
   966
    "intro.tex"
wenzelm@56781
   967
    "loop_invariant.adb"
wenzelm@56781
   968
    "loop_invariant.ads"
wenzelm@56781
   969
    "root.bib"
wenzelm@56781
   970
    "root.tex"
wenzelm@56781
   971
    "Simple_Gcd.adb"
wenzelm@56781
   972
    "Simple_Gcd.ads"
wenzelm@48481
   973
wenzelm@48738
   974
session "HOL-Mutabelle" in Mutabelle = HOL +
wenzelm@48483
   975
  options [document = false]
wenzelm@48481
   976
  theories MutabelleExtra
wenzelm@48481
   977
wenzelm@48738
   978
session "HOL-Quickcheck_Examples" in Quickcheck_Examples = HOL +
wenzelm@50179
   979
  options [document = false]
wenzelm@48588
   980
  theories
wenzelm@48690
   981
    Quickcheck_Examples
wenzelm@48690
   982
    Quickcheck_Lattice_Examples
wenzelm@48690
   983
    Completeness
wenzelm@48690
   984
    Quickcheck_Interfaces
wenzelm@57584
   985
  theories [condition = ISABELLE_GHC]
Andreas@57544
   986
    Hotel_Example
wenzelm@48598
   987
    Quickcheck_Narrowing_Examples
wenzelm@48588
   988
wenzelm@48738
   989
session "HOL-Quotient_Examples" in Quotient_Examples = HOL +
wenzelm@48481
   990
  description {*
wenzelm@48481
   991
    Author:     Cezary Kaliszyk and Christian Urban
wenzelm@48481
   992
  *}
wenzelm@48483
   993
  options [document = false]
wenzelm@48481
   994
  theories
wenzelm@48481
   995
    DList
wenzelm@48481
   996
    FSet
wenzelm@48481
   997
    Quotient_Int
wenzelm@48481
   998
    Quotient_Message
wenzelm@48481
   999
    Lift_FSet
wenzelm@48481
  1000
    Lift_Set
wenzelm@48481
  1001
    Lift_Fun
wenzelm@48481
  1002
    Quotient_Rat
wenzelm@48481
  1003
    Lift_DList
kuncar@53682
  1004
    Int_Pow
kuncar@60237
  1005
    Lifting_Code_Dt_Test
wenzelm@48481
  1006
wenzelm@48738
  1007
session "HOL-Predicate_Compile_Examples" in Predicate_Compile_Examples = HOL +
wenzelm@48483
  1008
  options [document = false]
wenzelm@62354
  1009
  theories
wenzelm@48481
  1010
    Examples
wenzelm@48481
  1011
    Predicate_Compile_Tests
Andreas@61140
  1012
    Predicate_Compile_Quickcheck_Examples
wenzelm@48481
  1013
    Specialisation_Examples
wenzelm@48690
  1014
    IMP_1
wenzelm@48690
  1015
    IMP_2
wenzelm@55450
  1016
    (* FIXME since 21-Jul-2011
Andreas@61140
  1017
    Hotel_Example_Small_Generator *)
wenzelm@48690
  1018
    IMP_3
Andreas@61140
  1019
    IMP_4
wenzelm@62242
  1020
  theories [condition = ISABELLE_SWIPL]
wenzelm@48690
  1021
    Code_Prolog_Examples
wenzelm@48690
  1022
    Context_Free_Grammar_Example
wenzelm@48690
  1023
    Hotel_Example_Prolog
wenzelm@48690
  1024
    Lambda_Example
wenzelm@48690
  1025
    List_Examples
wenzelm@62242
  1026
  theories [condition = ISABELLE_SWIPL, quick_and_dirty]
wenzelm@48690
  1027
    Reg_Exp_Example
wenzelm@48481
  1028
wenzelm@48738
  1029
session HOLCF (main) in HOLCF = HOL +
wenzelm@48338
  1030
  description {*
wenzelm@48338
  1031
    Author:     Franz Regensburger
wenzelm@48338
  1032
    Author:     Brian Huffman
wenzelm@48338
  1033
wenzelm@48338
  1034
    HOLCF -- a semantic extension of HOL by the LCF logic.
wenzelm@48338
  1035
  *}
wenzelm@48470
  1036
  theories [document = false]
wenzelm@48338
  1037
    "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48338
  1038
    "~~/src/HOL/Library/Countable"
wenzelm@48481
  1039
  theories
wenzelm@48481
  1040
    Plain_HOLCF
wenzelm@48481
  1041
    Fixrec
wenzelm@48481
  1042
    HOLCF
wenzelm@56781
  1043
  document_files "root.tex"
wenzelm@48481
  1044
wenzelm@48738
  1045
session "HOLCF-Tutorial" in "HOLCF/Tutorial" = HOLCF +
wenzelm@48481
  1046
  theories
wenzelm@48481
  1047
    Domain_ex
wenzelm@48481
  1048
    Fixrec_ex
wenzelm@48481
  1049
    New_Domain
wenzelm@56781
  1050
  document_files "root.tex"
wenzelm@48481
  1051
wenzelm@48738
  1052
session "HOLCF-Library" in "HOLCF/Library" = HOLCF +
wenzelm@48483
  1053
  options [document = false]
wenzelm@48481
  1054
  theories HOLCF_Library
wenzelm@48481
  1055
wenzelm@48738
  1056
session "HOLCF-IMP" in "HOLCF/IMP" = HOLCF +
wenzelm@51403
  1057
  description {*
wenzelm@51403
  1058
    IMP -- A WHILE-language and its Semantics.
wenzelm@51403
  1059
wenzelm@51403
  1060
    This is the HOLCF-based denotational semantics of a simple WHILE-language.
wenzelm@51403
  1061
  *}
wenzelm@48483
  1062
  options [document = false]
wenzelm@48481
  1063
  theories HoareEx
wenzelm@56781
  1064
  document_files "root.tex"
wenzelm@48338
  1065
wenzelm@48738
  1066
session "HOLCF-ex" in "HOLCF/ex" = HOLCF +
wenzelm@51421
  1067
  description {*
wenzelm@51421
  1068
    Miscellaneous examples for HOLCF.
wenzelm@51421
  1069
  *}
wenzelm@48483
  1070
  options [document = false]
wenzelm@48481
  1071
  theories
wenzelm@48481
  1072
    Dnat
wenzelm@48481
  1073
    Dagstuhl
wenzelm@48481
  1074
    Focus_ex
wenzelm@48481
  1075
    Fix2
wenzelm@48481
  1076
    Hoare
wenzelm@48481
  1077
    Concurrency_Monad
wenzelm@48481
  1078
    Loop
wenzelm@48481
  1079
    Powerdomain_ex
wenzelm@48481
  1080
    Domain_Proofs
wenzelm@48481
  1081
    Letrec
wenzelm@48481
  1082
    Pattern_Match
wenzelm@48481
  1083
wenzelm@48738
  1084
session "HOLCF-FOCUS" in "HOLCF/FOCUS" = HOLCF +
wenzelm@51403
  1085
  description {*
wenzelm@51403
  1086
    FOCUS: a theory of stream-processing functions Isabelle/HOLCF.
wenzelm@51403
  1087
wenzelm@51403
  1088
    For introductions to FOCUS, see
wenzelm@51403
  1089
wenzelm@51403
  1090
    "The Design of Distributed Systems - An Introduction to FOCUS"
wenzelm@51403
  1091
    http://www4.in.tum.de/publ/html.php?e=2
wenzelm@51403
  1092
wenzelm@51403
  1093
    "Specification and Refinement of a Buffer of Length One"
wenzelm@51403
  1094
    http://www4.in.tum.de/publ/html.php?e=15
wenzelm@51403
  1095
wenzelm@51403
  1096
    "Specification and Development of Interactive Systems: Focus on Streams,
wenzelm@51403
  1097
    Interfaces, and Refinement" http://www4.in.tum.de/publ/html.php?e=321
wenzelm@51403
  1098
  *}
wenzelm@48483
  1099
  options [document = false]
wenzelm@48481
  1100
  theories
wenzelm@48481
  1101
    Fstreams
wenzelm@48481
  1102
    FOCUS
wenzelm@48481
  1103
    Buffer_adm
wenzelm@48481
  1104
wenzelm@48738
  1105
session IOA in "HOLCF/IOA" = HOLCF +
wenzelm@48481
  1106
  description {*
wenzelm@48481
  1107
    Author:     Olaf Mueller
wenzelm@51403
  1108
    Copyright   1997 TU München
wenzelm@48481
  1109
wenzelm@51403
  1110
    A formalization of I/O automata in HOLCF.
wenzelm@51403
  1111
wenzelm@51403
  1112
    The distribution contains simulation relations, temporal logic, and an
wenzelm@51403
  1113
    abstraction theory. Everything is based upon a domain-theoretic model of
wenzelm@51403
  1114
    finite and infinite sequences.
wenzelm@48481
  1115
  *}
wenzelm@48483
  1116
  options [document = false]
wenzelm@62008
  1117
  theories "Abstraction"
wenzelm@48481
  1118
wenzelm@48738
  1119
session "IOA-ABP" in "HOLCF/IOA/ABP" = IOA +
wenzelm@48481
  1120
  description {*
wenzelm@48481
  1121
    Author:     Olaf Mueller
wenzelm@48481
  1122
wenzelm@48481
  1123
    The Alternating Bit Protocol performed in I/O-Automata.
wenzelm@48481
  1124
  *}
wenzelm@48483
  1125
  options [document = false]
wenzelm@59503
  1126
  theories
wenzelm@59503
  1127
    Correctness
wenzelm@59503
  1128
    Spec
wenzelm@48481
  1129
wenzelm@48738
  1130
session "IOA-NTP" in "HOLCF/IOA/NTP" = IOA +
wenzelm@48481
  1131
  description {*
wenzelm@48481
  1132
    Author:     Tobias Nipkow & Konrad Slind
wenzelm@48481
  1133
wenzelm@48481
  1134
    A network transmission protocol, performed in the
wenzelm@48481
  1135
    I/O automata formalization by Olaf Mueller.
wenzelm@48481
  1136
  *}
wenzelm@48483
  1137
  options [document = false]
wenzelm@48481
  1138
  theories Correctness
wenzelm@48481
  1139
wenzelm@48738
  1140
session "IOA-Storage" in "HOLCF/IOA/Storage" = IOA +
wenzelm@48481
  1141
  description {*
wenzelm@48481
  1142
    Author:     Olaf Mueller
wenzelm@48481
  1143
wenzelm@48481
  1144
    Memory storage case study.
wenzelm@48481
  1145
  *}
wenzelm@48483
  1146
  options [document = false]
wenzelm@48481
  1147
  theories Correctness
wenzelm@48481
  1148
wenzelm@48738
  1149
session "IOA-ex" in "HOLCF/IOA/ex" = IOA +
wenzelm@48481
  1150
  description {*
wenzelm@48481
  1151
    Author:     Olaf Mueller
wenzelm@48481
  1152
  *}
wenzelm@48483
  1153
  options [document = false]
wenzelm@48481
  1154
  theories
wenzelm@48481
  1155
    TrivEx
wenzelm@48481
  1156
    TrivEx2