src/HOL/ROOT
author wenzelm
Thu Sep 08 18:18:57 2016 +0200 (2016-09-08)
changeset 63827 b24d0e53dd03
parent 63763 0f61ea70d384
child 63829 6a05c8cbf7de
permissions -rw-r--r--
option "checkpoint" helps to fine-tune global heap space management;
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!*)
wenzelm@63827
    23
  theories List
wenzelm@63827
    24
  theories [checkpoint] "~~/src/HOL/Library/Old_Datatype"
wenzelm@48901
    25
  files
wenzelm@48901
    26
    "Tools/Quickcheck/Narrowing_Engine.hs"
wenzelm@48901
    27
    "Tools/Quickcheck/PNF_Narrowing_Engine.hs"
wenzelm@48338
    28
wenzelm@50844
    29
session "HOL-Library" (main) in Library = HOL +
wenzelm@51421
    30
  description {*
wenzelm@51421
    31
    Classical Higher-order Logic -- batteries included.
wenzelm@51421
    32
  *}
wenzelm@48481
    33
  theories
wenzelm@48481
    34
    Library
wenzelm@63763
    35
    Nonpos_Ints
wenzelm@63763
    36
    Periodic_Fun
wenzelm@63763
    37
    Polynomial_Factorial
wenzelm@63763
    38
    Predicate_Compile_Quickcheck
wenzelm@63763
    39
    Prefix_Order
wenzelm@59973
    40
    Rewrite
haftmann@51161
    41
    (*conflicting type class instantiations*)
wenzelm@48481
    42
    List_lexord
wenzelm@48481
    43
    Sublist_Order
haftmann@51115
    44
    Product_Lexorder
haftmann@51115
    45
    Product_Order
haftmann@51161
    46
    Finite_Lattice
haftmann@51161
    47
    (*data refinements and dependent applications*)
haftmann@51161
    48
    AList_Mapping
haftmann@51161
    49
    Code_Binary_Nat
haftmann@51161
    50
    Code_Char
wenzelm@55447
    51
    Code_Prolog
wenzelm@48481
    52
    Code_Real_Approx_By_Float
haftmann@50023
    53
    Code_Target_Numeral
haftmann@51161
    54
    DAList
haftmann@54429
    55
    DAList_Multiset
haftmann@51161
    56
    RBT_Mapping
haftmann@51161
    57
    RBT_Set
haftmann@51161
    58
    (*legacy tools*)
blanchet@49985
    59
    Refute
blanchet@58372
    60
    Old_Datatype
haftmann@51161
    61
    Old_Recdef
blanchet@58110
    62
    Old_SMT
wenzelm@56781
    63
  document_files "root.bib" "root.tex"
wenzelm@48481
    64
wenzelm@48738
    65
session "HOL-Hahn_Banach" in Hahn_Banach = HOL +
wenzelm@48481
    66
  description {*
wenzelm@48481
    67
    Author:     Gertrud Bauer, TU Munich
wenzelm@48481
    68
wenzelm@48481
    69
    The Hahn-Banach theorem for real vector spaces.
wenzelm@51403
    70
wenzelm@51403
    71
    This is the proof of the Hahn-Banach theorem for real vectorspaces,
wenzelm@51403
    72
    following H. Heuser, Funktionalanalysis, p. 228 -232. The Hahn-Banach
blanchet@55018
    73
    theorem is one of the fundamental theorems of functional analysis. It is a
wenzelm@51403
    74
    conclusion of Zorn's lemma.
wenzelm@51403
    75
wenzelm@51403
    76
    Two different formaulations of the theorem are presented, one for general
wenzelm@51403
    77
    real vectorspaces and its application to normed vectorspaces.
wenzelm@51403
    78
wenzelm@51403
    79
    The theorem says, that every continous linearform, defined on arbitrary
wenzelm@51403
    80
    subspaces (not only one-dimensional subspaces), can be extended to a
wenzelm@51403
    81
    continous linearform on the whole vectorspace.
wenzelm@48481
    82
  *}
wenzelm@48481
    83
  theories Hahn_Banach
wenzelm@56781
    84
  document_files "root.bib" "root.tex"
wenzelm@48481
    85
wenzelm@48738
    86
session "HOL-Induct" in Induct = HOL +
wenzelm@51403
    87
  description {*
wenzelm@51403
    88
    Examples of (Co)Inductive Definitions.
wenzelm@51403
    89
wenzelm@51403
    90
    Comb proves the Church-Rosser theorem for combinators (see
wenzelm@51403
    91
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz).
wenzelm@51403
    92
wenzelm@51403
    93
    Mutil is the famous Mutilated Chess Board problem (see
wenzelm@51403
    94
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR394-lcp-mutilated-chess-board.dvi.gz).
wenzelm@51403
    95
wenzelm@51403
    96
    PropLog proves the completeness of a formalization of propositional logic
wenzelm@51403
    97
    (see
blanchet@58372
    98
    http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz).
wenzelm@51403
    99
wenzelm@51403
   100
    Exp demonstrates the use of iterated inductive definitions to reason about
wenzelm@51403
   101
    mutually recursive relations.
wenzelm@51403
   102
  *}
blanchet@58372
   103
  theories [document = false]
blanchet@58372
   104
    "~~/src/HOL/Library/Old_Datatype"
wenzelm@48481
   105
  theories [quick_and_dirty]
wenzelm@48481
   106
    Common_Patterns
wenzelm@48481
   107
  theories
wenzelm@61935
   108
    Nested_Datatype
wenzelm@48481
   109
    QuoDataType
wenzelm@48481
   110
    QuoNestedDataType
wenzelm@48481
   111
    Term
wenzelm@48481
   112
    SList
wenzelm@48481
   113
    ABexp
wenzelm@48481
   114
    Tree
wenzelm@48481
   115
    Ordinals
wenzelm@48481
   116
    Sigma_Algebra
wenzelm@48481
   117
    Comb
wenzelm@48481
   118
    PropLog
wenzelm@48481
   119
    Com
wenzelm@56781
   120
  document_files "root.tex"
wenzelm@48481
   121
wenzelm@48738
   122
session "HOL-IMP" in IMP = HOL +
wenzelm@59446
   123
  options [document_variants = document]
wenzelm@48481
   124
  theories [document = false]
wenzelm@48481
   125
    "~~/src/HOL/Library/While_Combinator"
wenzelm@48481
   126
    "~~/src/HOL/Library/Char_ord"
wenzelm@48481
   127
    "~~/src/HOL/Library/List_lexord"
nipkow@51625
   128
    "~~/src/HOL/Library/Quotient_List"
nipkow@51625
   129
    "~~/src/HOL/Library/Extended"
wenzelm@48481
   130
  theories
wenzelm@48481
   131
    BExp
wenzelm@48481
   132
    ASM
nipkow@50050
   133
    Finite_Reachable
nipkow@52394
   134
    Denotational
nipkow@52400
   135
    Compiler2
wenzelm@48481
   136
    Poly_Types
wenzelm@48481
   137
    Sec_Typing
wenzelm@48481
   138
    Sec_TypingT
nipkow@52726
   139
    Def_Init_Big
nipkow@52726
   140
    Def_Init_Small
nipkow@52726
   141
    Fold
wenzelm@48481
   142
    Live
wenzelm@48481
   143
    Live_True
wenzelm@48481
   144
    Hoare_Examples
nipkow@63538
   145
    Hoare_Sound_Complete
nipkow@52269
   146
    VCG
nipkow@52282
   147
    Hoare_Total
nipkow@63538
   148
    VCG_Total_EX
wenzelm@48481
   149
    Collecting1
nipkow@48765
   150
    Collecting_Examples
wenzelm@48481
   151
    Abs_Int_Tests
wenzelm@48481
   152
    Abs_Int1_parity
wenzelm@48481
   153
    Abs_Int1_const
wenzelm@48481
   154
    Abs_Int3
wenzelm@48481
   155
    "Abs_Int_ITP/Abs_Int1_parity_ITP"
wenzelm@48481
   156
    "Abs_Int_ITP/Abs_Int1_const_ITP"
wenzelm@48481
   157
    "Abs_Int_ITP/Abs_Int3_ITP"
wenzelm@48481
   158
    Procs_Dyn_Vars_Dyn
wenzelm@48481
   159
    Procs_Stat_Vars_Dyn
wenzelm@48481
   160
    Procs_Stat_Vars_Stat
wenzelm@48481
   161
    C_like
wenzelm@48481
   162
    OO
wenzelm@56781
   163
  document_files "root.bib" "root.tex"
wenzelm@48481
   164
wenzelm@48738
   165
session "HOL-IMPP" in IMPP = HOL +
wenzelm@48481
   166
  description {*
wenzelm@48481
   167
    Author:     David von Oheimb
wenzelm@48481
   168
    Copyright   1999 TUM
wenzelm@51403
   169
wenzelm@51403
   170
    IMPP -- An imperative language with procedures.
wenzelm@51403
   171
wenzelm@51403
   172
    This is an extension of IMP with local variables and mutually recursive
wenzelm@51403
   173
    procedures. For documentation see "Hoare Logic for Mutual Recursion and
wenzelm@51403
   174
    Local Variables" (http://isabelle.in.tum.de/Bali/papers/FSTTCS99.html).
wenzelm@48481
   175
  *}
wenzelm@48483
   176
  options [document = false]
wenzelm@48481
   177
  theories EvenOdd
wenzelm@48481
   178
nipkow@61203
   179
session "HOL-Data_Structures" in Data_Structures = HOL +
nipkow@61203
   180
  options [document_variants = document]
nipkow@61203
   181
  theories [document = false]
nipkow@61203
   182
    "Less_False"
nipkow@62706
   183
    "~~/src/HOL/Library/Multiset"
nipkow@63643
   184
    "~~/src/HOL/Library/Float"
nipkow@61203
   185
  theories
nipkow@63643
   186
    Balance_List
nipkow@61203
   187
    Tree_Map
nipkow@61232
   188
    AVL_Map
nipkow@61224
   189
    RBT_Map
nipkow@61469
   190
    Tree23_Map
nipkow@61514
   191
    Tree234_Map
nipkow@61789
   192
    Brother12_Map
nipkow@62130
   193
    AA_Map
nipkow@61525
   194
    Splay_Map
nipkow@62706
   195
    Leftist_Heap
nipkow@61224
   196
  document_files "root.tex" "root.bib"
nipkow@61203
   197
wenzelm@48738
   198
session "HOL-Import" in Import = HOL +
wenzelm@48481
   199
  theories HOL_Light_Maps
wenzelm@48481
   200
  theories [condition = HOL_LIGHT_BUNDLE] HOL_Light_Import
wenzelm@48481
   201
wenzelm@48738
   202
session "HOL-Number_Theory" in Number_Theory = HOL +
lp15@55321
   203
  description {*
lp15@55321
   204
    Fundamental Theorem of Arithmetic, Chinese Remainder Theorem, Fermat/Euler
lp15@55730
   205
    Theorem, Wilson's Theorem, some lemmas for Quadratic Reciprocity.
lp15@55321
   206
  *}
lp15@55321
   207
  theories [document = false]
lp15@55321
   208
    "~~/src/HOL/Library/FuncSet"
lp15@55321
   209
    "~~/src/HOL/Library/Multiset"
lp15@55321
   210
    "~~/src/HOL/Algebra/Ring"
lp15@55321
   211
    "~~/src/HOL/Algebra/FiniteProduct"
lp15@55321
   212
  theories
lp15@55321
   213
    Pocklington
lp15@55730
   214
    Gauss
lp15@55321
   215
    Number_Theory
haftmann@58023
   216
    Euclidean_Algorithm
haftmann@60804
   217
    Factorial_Ring
wenzelm@56781
   218
  document_files
wenzelm@56781
   219
    "root.tex"
wenzelm@48481
   220
wenzelm@48738
   221
session "HOL-Old_Number_Theory" in Old_Number_Theory = HOL +
wenzelm@51403
   222
  description {*
wenzelm@51403
   223
    Fundamental Theorem of Arithmetic, Chinese Remainder Theorem, Fermat/Euler
wenzelm@51403
   224
    Theorem, Wilson's Theorem, Quadratic Reciprocity.
wenzelm@51403
   225
  *}
wenzelm@48481
   226
  theories [document = false]
wenzelm@48481
   227
    "~~/src/HOL/Library/Infinite_Set"
wenzelm@48481
   228
    "~~/src/HOL/Library/Permutation"
wenzelm@48481
   229
  theories
wenzelm@48481
   230
    Fib
wenzelm@48481
   231
    Factorization
wenzelm@48481
   232
    Chinese
wenzelm@48481
   233
    WilsonRuss
wenzelm@48481
   234
    WilsonBij
wenzelm@48481
   235
    Quadratic_Reciprocity
wenzelm@48481
   236
    Primes
wenzelm@48481
   237
    Pocklington
wenzelm@58623
   238
  document_files
wenzelm@58623
   239
    "root.bib"
wenzelm@58623
   240
    "root.tex"
wenzelm@48481
   241
wenzelm@48738
   242
session "HOL-Hoare" in Hoare = HOL +
wenzelm@51403
   243
  description {*
wenzelm@51403
   244
    Verification of imperative programs (verification conditions are generated
wenzelm@51403
   245
    automatically from pre/post conditions and loop invariants).
wenzelm@51403
   246
  *}
wenzelm@48481
   247
  theories Hoare
wenzelm@56781
   248
  document_files "root.bib" "root.tex"
wenzelm@48481
   249
wenzelm@48738
   250
session "HOL-Hoare_Parallel" in Hoare_Parallel = HOL +
wenzelm@51403
   251
  description {*
wenzelm@51403
   252
    Verification of shared-variable imperative programs a la Owicki-Gries.
wenzelm@51403
   253
    (verification conditions are generated automatically).
wenzelm@51403
   254
  *}
wenzelm@48481
   255
  theories Hoare_Parallel
wenzelm@56781
   256
  document_files "root.bib" "root.tex"
wenzelm@48481
   257
wenzelm@48738
   258
session "HOL-Codegenerator_Test" in Codegenerator_Test = "HOL-Library" +
wenzelm@62354
   259
  options [document = false, browser_info = false]
wenzelm@51422
   260
  theories
wenzelm@51422
   261
    Generate
wenzelm@51422
   262
    Generate_Binary_Nat
wenzelm@51422
   263
    Generate_Target_Nat
wenzelm@51422
   264
    Generate_Efficient_Datastructures
wenzelm@51422
   265
    Generate_Pretty_Char
wenzelm@62354
   266
  theories [condition = "ISABELLE_GHC"]
Andreas@58039
   267
    Code_Test_GHC
wenzelm@62354
   268
  theories [condition = "ISABELLE_MLTON"]
Andreas@58039
   269
    Code_Test_MLton
wenzelm@62354
   270
  theories [condition = "ISABELLE_OCAMLC"]
Andreas@58039
   271
    Code_Test_OCaml
wenzelm@62354
   272
  theories [condition = "ISABELLE_POLYML"]
Andreas@58039
   273
    Code_Test_PolyML
wenzelm@62354
   274
  theories [condition = "ISABELLE_SCALA"]
Andreas@58039
   275
    Code_Test_Scala
wenzelm@62354
   276
  theories [condition = "ISABELLE_SMLNJ"]
Andreas@58039
   277
    Code_Test_SMLNJ
wenzelm@48481
   278
wenzelm@48738
   279
session "HOL-Metis_Examples" in Metis_Examples = HOL +
wenzelm@48481
   280
  description {*
wenzelm@48481
   281
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   282
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   283
wenzelm@48481
   284
    Testing Metis and Sledgehammer.
wenzelm@48481
   285
  *}
wenzelm@58423
   286
  options [document = false]
wenzelm@48481
   287
  theories
wenzelm@48481
   288
    Abstraction
wenzelm@48481
   289
    Big_O
wenzelm@48481
   290
    Binary_Tree
wenzelm@48481
   291
    Clausification
wenzelm@48481
   292
    Message
wenzelm@48481
   293
    Proxies
wenzelm@48481
   294
    Tarski
wenzelm@48481
   295
    Trans_Closure
wenzelm@48481
   296
    Sets
wenzelm@48481
   297
blanchet@55072
   298
session "HOL-Nitpick_Examples" in Nitpick_Examples = HOL +
wenzelm@48481
   299
  description {*
wenzelm@48481
   300
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   301
    Copyright   2009
wenzelm@48481
   302
  *}
wenzelm@48483
   303
  options [document = false]
wenzelm@48481
   304
  theories [quick_and_dirty] Nitpick_Examples
wenzelm@48481
   305
wenzelm@50844
   306
session "HOL-Algebra" (main) in Algebra = HOL +
wenzelm@48481
   307
  description {*
wenzelm@48481
   308
    Author: Clemens Ballarin, started 24 September 1999
wenzelm@48481
   309
wenzelm@48481
   310
    The Isabelle Algebraic Library.
wenzelm@48481
   311
  *}
wenzelm@48481
   312
  theories [document = false]
wenzelm@48481
   313
    (* Preliminaries from set and number theory *)
wenzelm@48481
   314
    "~~/src/HOL/Library/FuncSet"
lp15@55159
   315
    "~~/src/HOL/Number_Theory/Primes"
wenzelm@48481
   316
    "~~/src/HOL/Library/Permutation"
wenzelm@48481
   317
  theories
wenzelm@48481
   318
    (*** New development, based on explicit structures ***)
wenzelm@48481
   319
    (* Groups *)
wenzelm@48481
   320
    FiniteProduct        (* Product operator for commutative groups *)
wenzelm@48481
   321
    Sylow                (* Sylow's theorem *)
wenzelm@48481
   322
    Bij                  (* Automorphism Groups *)
wenzelm@48481
   323
wenzelm@48481
   324
    (* Rings *)
wenzelm@48481
   325
    Divisibility         (* Rings *)
wenzelm@48481
   326
    IntRing              (* Ideals and residue classes *)
wenzelm@48481
   327
    UnivPoly             (* Polynomials *)
wenzelm@56781
   328
  document_files "root.bib" "root.tex"
wenzelm@48481
   329
wenzelm@48738
   330
session "HOL-Auth" in Auth = HOL +
wenzelm@51421
   331
  description {*
wenzelm@51421
   332
    A new approach to verifying authentication protocols.
wenzelm@51421
   333
  *}
wenzelm@48481
   334
  theories
wenzelm@48481
   335
    Auth_Shared
wenzelm@48481
   336
    Auth_Public
wenzelm@48481
   337
    "Smartcard/Auth_Smartcard"
wenzelm@48481
   338
    "Guard/Auth_Guard_Shared"
wenzelm@48481
   339
    "Guard/Auth_Guard_Public"
wenzelm@56781
   340
  document_files "root.tex"
wenzelm@48481
   341
wenzelm@51236
   342
session "HOL-UNITY" in UNITY = "HOL-Auth" +
wenzelm@48481
   343
  description {*
wenzelm@48481
   344
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   345
    Copyright   1998  University of Cambridge
wenzelm@48481
   346
wenzelm@51403
   347
    Verifying security protocols using Chandy and Misra's UNITY formalism.
wenzelm@48481
   348
  *}
wenzelm@48481
   349
  theories
wenzelm@48481
   350
    (*Basic meta-theory*)
wenzelm@48481
   351
    "UNITY_Main"
wenzelm@48481
   352
wenzelm@48481
   353
    (*Simple examples: no composition*)
wenzelm@48481
   354
    "Simple/Deadlock"
wenzelm@48481
   355
    "Simple/Common"
wenzelm@48481
   356
    "Simple/Network"
wenzelm@48481
   357
    "Simple/Token"
wenzelm@48481
   358
    "Simple/Channel"
wenzelm@48481
   359
    "Simple/Lift"
wenzelm@48481
   360
    "Simple/Mutex"
wenzelm@48481
   361
    "Simple/Reach"
wenzelm@48481
   362
    "Simple/Reachability"
wenzelm@48481
   363
wenzelm@48481
   364
    (*Verifying security protocols using UNITY*)
wenzelm@48481
   365
    "Simple/NSP_Bad"
wenzelm@48481
   366
wenzelm@48481
   367
    (*Example of composition*)
wenzelm@48481
   368
    "Comp/Handshake"
wenzelm@48481
   369
wenzelm@48481
   370
    (*Universal properties examples*)
wenzelm@48481
   371
    "Comp/Counter"
wenzelm@48481
   372
    "Comp/Counterc"
wenzelm@48481
   373
    "Comp/Priority"
wenzelm@48481
   374
wenzelm@48481
   375
    "Comp/TimerArray"
wenzelm@48481
   376
    "Comp/Progress"
wenzelm@48481
   377
wenzelm@48481
   378
    "Comp/Alloc"
wenzelm@48481
   379
    "Comp/AllocImpl"
wenzelm@48481
   380
    "Comp/Client"
wenzelm@48481
   381
wenzelm@48481
   382
    (*obsolete*)
wenzelm@48481
   383
    "ELT"
wenzelm@56781
   384
  document_files "root.tex"
wenzelm@48481
   385
wenzelm@48738
   386
session "HOL-Unix" in Unix = HOL +
wenzelm@48481
   387
  options [print_mode = "no_brackets,no_type_brackets"]
wenzelm@48481
   388
  theories Unix
wenzelm@56781
   389
  document_files "root.bib" "root.tex"
wenzelm@48481
   390
wenzelm@48738
   391
session "HOL-ZF" in ZF = HOL +
wenzelm@48481
   392
  theories MainZF Games
wenzelm@56781
   393
  document_files "root.tex"
wenzelm@48481
   394
wenzelm@48738
   395
session "HOL-Imperative_HOL" in Imperative_HOL = HOL +
wenzelm@59446
   396
  options [print_mode = "iff,no_brackets"]
wenzelm@48481
   397
  theories [document = false]
wenzelm@48481
   398
    "~~/src/HOL/Library/Countable"
wenzelm@48481
   399
    "~~/src/HOL/Library/Monad_Syntax"
wenzelm@48481
   400
    "~~/src/HOL/Library/LaTeXsugar"
wenzelm@48481
   401
  theories Imperative_HOL_ex
wenzelm@56781
   402
  document_files "root.bib" "root.tex"
wenzelm@48481
   403
wenzelm@48738
   404
session "HOL-Decision_Procs" in Decision_Procs = HOL +
wenzelm@51544
   405
  description {*
wenzelm@51544
   406
    Various decision procedures, typically involving reflection.
wenzelm@51544
   407
  *}
wenzelm@62354
   408
  options [document = false]
wenzelm@48481
   409
  theories Decision_Procs
wenzelm@48481
   410
lars@63000
   411
session "HOL-Proofs-ex" in "Proofs/ex" = "HOL-Proofs" +
wenzelm@62354
   412
  options [document = false, parallel_proofs = 0]
wenzelm@52424
   413
  theories
wenzelm@52424
   414
    Hilbert_Classical
wenzelm@62363
   415
    Proof_Terms
wenzelm@52424
   416
    XML_Data
wenzelm@48481
   417
lars@63000
   418
session "HOL-Proofs-Extraction" in "Proofs/Extraction" = "HOL-Proofs" +
wenzelm@51421
   419
  description {*
wenzelm@51421
   420
    Examples for program extraction in Higher-Order Logic.
wenzelm@51421
   421
  *}
wenzelm@62354
   422
  options [parallel_proofs = 0, quick_and_dirty = false]
wenzelm@48481
   423
  theories [document = false]
haftmann@51143
   424
    "~~/src/HOL/Library/Code_Target_Numeral"
wenzelm@48481
   425
    "~~/src/HOL/Library/Monad_Syntax"
wenzelm@48481
   426
    "~~/src/HOL/Number_Theory/Primes"
wenzelm@48481
   427
    "~~/src/HOL/Library/State_Monad"
wenzelm@48481
   428
  theories
wenzelm@48481
   429
    Greatest_Common_Divisor
wenzelm@48481
   430
    Warshall
wenzelm@48481
   431
    Higman_Extraction
wenzelm@48481
   432
    Pigeonhole
wenzelm@48481
   433
    Euclid
wenzelm@56781
   434
  document_files "root.bib" "root.tex"
wenzelm@48481
   435
lars@63000
   436
session "HOL-Proofs-Lambda" in "Proofs/Lambda" = "HOL-Proofs" +
wenzelm@51403
   437
  description {*
wenzelm@51403
   438
    Lambda Calculus in de Bruijn's Notation.
wenzelm@51403
   439
wenzelm@51403
   440
    This session defines lambda-calculus terms with de Bruijn indixes and
wenzelm@51403
   441
    proves confluence of beta, eta and beta+eta.
wenzelm@51403
   442
wenzelm@51403
   443
    The paper "More Church-Rosser Proofs (in Isabelle/HOL)" describes the whole
wenzelm@51403
   444
    theory (see http://www.in.tum.de/~nipkow/pubs/jar2001.html).
wenzelm@51403
   445
  *}
wenzelm@62354
   446
  options [print_mode = "no_brackets",
wenzelm@62242
   447
    parallel_proofs = 0, quick_and_dirty = false]
wenzelm@48481
   448
  theories [document = false]
haftmann@51143
   449
    "~~/src/HOL/Library/Code_Target_Int"
wenzelm@48481
   450
  theories
wenzelm@48481
   451
    Eta
wenzelm@48481
   452
    StrongNorm
wenzelm@48481
   453
    Standardization
wenzelm@48481
   454
    WeakNorm
wenzelm@56781
   455
  document_files "root.bib" "root.tex"
wenzelm@48481
   456
wenzelm@48738
   457
session "HOL-Prolog" in Prolog = HOL +
wenzelm@48481
   458
  description {*
wenzelm@48481
   459
    Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
wenzelm@51403
   460
wenzelm@51403
   461
    A bare-bones implementation of Lambda-Prolog.
wenzelm@51403
   462
wenzelm@51403
   463
    This is a simple exploratory implementation of Lambda-Prolog in HOL,
wenzelm@51403
   464
    including some minimal examples (in Test.thy) and a more typical example of
wenzelm@51403
   465
    a little functional language and its type system.
wenzelm@48481
   466
  *}
wenzelm@48483
   467
  options [document = false]
wenzelm@48481
   468
  theories Test Type
wenzelm@48481
   469
wenzelm@48738
   470
session "HOL-MicroJava" in MicroJava = HOL +
wenzelm@51403
   471
  description {*
wenzelm@51403
   472
    Formalization of a fragment of Java, together with a corresponding virtual
wenzelm@51403
   473
    machine and a specification of its bytecode verifier and a lightweight
wenzelm@51403
   474
    bytecode verifier, including proofs of type-safety.
wenzelm@51403
   475
  *}
wenzelm@59446
   476
  theories [document = false]
wenzelm@59446
   477
    "~~/src/HOL/Library/While_Combinator"
wenzelm@59446
   478
  theories
wenzelm@59446
   479
    MicroJava
wenzelm@56781
   480
  document_files
wenzelm@56781
   481
    "introduction.tex"
wenzelm@56781
   482
    "root.bib"
wenzelm@56781
   483
    "root.tex"
wenzelm@48481
   484
wenzelm@48738
   485
session "HOL-NanoJava" in NanoJava = HOL +
wenzelm@51403
   486
  description {*
wenzelm@51403
   487
    Hoare Logic for a tiny fragment of Java.
wenzelm@51403
   488
  *}
wenzelm@48481
   489
  theories Example
wenzelm@56781
   490
  document_files "root.bib" "root.tex"
wenzelm@48481
   491
wenzelm@48738
   492
session "HOL-Bali" in Bali = HOL +
wenzelm@48481
   493
  theories
wenzelm@48481
   494
    AxExample
wenzelm@48481
   495
    AxSound
wenzelm@48481
   496
    AxCompl
wenzelm@48481
   497
    Trans
wenzelm@60751
   498
    TypeSafe
wenzelm@56781
   499
  document_files "root.tex"
wenzelm@48481
   500
wenzelm@48738
   501
session "HOL-IOA" in IOA = HOL +
wenzelm@48481
   502
  description {*
wenzelm@51403
   503
    Author:     Tobias Nipkow and Konrad Slind and Olaf Müller
wenzelm@51403
   504
    Copyright   1994--1996  TU Muenchen
wenzelm@48481
   505
blanchet@55417
   506
    The meta-theory of I/O-Automata in HOL. This formalization has been
wenzelm@51403
   507
    significantly changed and extended, see HOLCF/IOA. There are also the
wenzelm@51403
   508
    proofs of two communication protocols which formerly have been here.
wenzelm@48481
   509
wenzelm@48481
   510
    @inproceedings{Nipkow-Slind-IOA,
wenzelm@48481
   511
    author={Tobias Nipkow and Konrad Slind},
wenzelm@48481
   512
    title={{I/O} Automata in {Isabelle/HOL}},
wenzelm@48481
   513
    booktitle={Proc.\ TYPES Workshop 1994},
wenzelm@48481
   514
    publisher=Springer,
wenzelm@48481
   515
    series=LNCS,
wenzelm@48481
   516
    note={To appear}}
wenzelm@48481
   517
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/ioa.ps.gz
wenzelm@48481
   518
wenzelm@48481
   519
    and
wenzelm@48481
   520
wenzelm@48481
   521
    @inproceedings{Mueller-Nipkow,
wenzelm@48481
   522
    author={Olaf M\"uller and Tobias Nipkow},
wenzelm@48481
   523
    title={Combining Model Checking and Deduction for {I/O}-Automata},
wenzelm@48481
   524
    booktitle={Proc.\ TACAS Workshop},
wenzelm@48481
   525
    organization={Aarhus University, BRICS report},
wenzelm@48481
   526
    year=1995}
wenzelm@48481
   527
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/tacas.dvi.gz
wenzelm@48481
   528
  *}
wenzelm@48483
   529
  options [document = false]
wenzelm@48481
   530
  theories Solve
wenzelm@48481
   531
wenzelm@48738
   532
session "HOL-Lattice" in Lattice = HOL +
wenzelm@48481
   533
  description {*
wenzelm@48481
   534
    Author:     Markus Wenzel, TU Muenchen
wenzelm@48481
   535
wenzelm@48481
   536
    Basic theory of lattices and orders.
wenzelm@48481
   537
  *}
wenzelm@48481
   538
  theories CompleteLattice
wenzelm@56781
   539
  document_files "root.tex"
wenzelm@48481
   540
wenzelm@48738
   541
session "HOL-ex" in ex = HOL +
wenzelm@51421
   542
  description {*
wenzelm@51421
   543
    Miscellaneous examples for Higher-Order Logic.
wenzelm@51421
   544
  *}
wenzelm@48481
   545
  theories [document = false]
wenzelm@48481
   546
    "~~/src/HOL/Library/State_Monad"
haftmann@50023
   547
    Code_Binary_Nat_examples
wenzelm@48481
   548
    "~~/src/HOL/Library/FuncSet"
wenzelm@48481
   549
    Eval_Examples
wenzelm@48481
   550
    Normalization_by_Evaluation
wenzelm@48481
   551
    Hebrew
wenzelm@48481
   552
    Chinese
wenzelm@48481
   553
    Serbian
blanchet@49985
   554
    "~~/src/HOL/Library/Refute"
haftmann@56922
   555
    "~~/src/HOL/Library/Transitive_Closure_Table"
wenzelm@55123
   556
    Cartouche_Examples
wenzelm@48481
   557
  theories
wenzelm@59090
   558
    Commands
wenzelm@57507
   559
    Adhoc_Overloading_Examples
wenzelm@48481
   560
    Iff_Oracle
wenzelm@48481
   561
    Coercion_Examples
wenzelm@48481
   562
    Abstract_NAT
wenzelm@48481
   563
    Guess
wenzelm@62999
   564
    Functions
wenzelm@48481
   565
    Induction_Schema
wenzelm@48481
   566
    LocaleTest2
wenzelm@48481
   567
    Records
wenzelm@48481
   568
    While_Combinator_Example
wenzelm@48481
   569
    MonoidGroup
wenzelm@48481
   570
    BinEx
wenzelm@48481
   571
    Hex_Bin_Examples
wenzelm@48481
   572
    Antiquote
wenzelm@48481
   573
    Multiquote
wenzelm@48481
   574
    PER
wenzelm@48481
   575
    NatSum
wenzelm@48481
   576
    ThreeDivides
kleing@59190
   577
    Cubic_Quartic
noschinl@59739
   578
    Pythagoras
wenzelm@48481
   579
    Intuitionistic
wenzelm@48481
   580
    CTL
wenzelm@48481
   581
    Arith_Examples
wenzelm@48481
   582
    Tree23
nipkow@58644
   583
    Bubblesort
wenzelm@48481
   584
    MergeSort
wenzelm@48481
   585
    Lagrange
wenzelm@48481
   586
    Groebner_Examples
wenzelm@48481
   587
    Unification
wenzelm@48481
   588
    Primrec
wenzelm@48481
   589
    Tarski
wenzelm@48481
   590
    Classical
wenzelm@48481
   591
    Set_Theory
wenzelm@48481
   592
    Termination
wenzelm@48481
   593
    Coherent
wenzelm@48481
   594
    PresburgerEx
haftmann@51093
   595
    Reflection_Examples
wenzelm@48481
   596
    Sqrt
wenzelm@48481
   597
    Sqrt_Script
kuncar@61368
   598
    Transfer_Debug
wenzelm@48481
   599
    Transfer_Ex
wenzelm@48481
   600
    Transfer_Int_Nat
haftmann@56922
   601
    Transitive_Closure_Table_Ex
wenzelm@48481
   602
    HarmonicSeries
wenzelm@48481
   603
    Refute_Examples
wenzelm@48481
   604
    Execute_Choice
wenzelm@48481
   605
    Gauge_Integration
wenzelm@48481
   606
    Dedekind_Real
wenzelm@48481
   607
    Quicksort
wenzelm@48481
   608
    Birthday_Paradox
wenzelm@48481
   609
    List_to_Set_Comprehension_Examples
wenzelm@48481
   610
    Seq
wenzelm@48481
   611
    Simproc_Tests
wenzelm@48481
   612
    Executable_Relation
wenzelm@48481
   613
    FinFunPred
wenzelm@55663
   614
    Set_Comprehension_Pointfree_Examples
wenzelm@48481
   615
    Parallel_Example
nipkow@50138
   616
    IArray_Examples
noschinl@53430
   617
    Simps_Case_Conv_Examples
wenzelm@53935
   618
    ML
noschinl@59739
   619
    Rewrite_Examples
boehmes@56815
   620
    SAT_Examples
wenzelm@58630
   621
    SOS
wenzelm@58418
   622
    SOS_Cert
bulwahn@60603
   623
    Ballot
bulwahn@60603
   624
    Erdoes_Szekeres
bulwahn@60603
   625
    Sum_of_Powers
wenzelm@62285
   626
    Sudoku
haftmann@63165
   627
    Code_Timing
haftmann@63375
   628
    Perm_Fragments
wenzelm@51558
   629
  theories [skip_proofs = false]
wenzelm@51558
   630
    Meson_Test
wenzelm@56781
   631
  document_files "root.bib" "root.tex"
wenzelm@48481
   632
wenzelm@48738
   633
session "HOL-Isar_Examples" in Isar_Examples = HOL +
wenzelm@51403
   634
  description {*
wenzelm@61935
   635
    Miscellaneous Isabelle/Isar examples.
wenzelm@51403
   636
  *}
wenzelm@61939
   637
  options [quick_and_dirty]
wenzelm@48481
   638
  theories [document = false]
wenzelm@48481
   639
    "~~/src/HOL/Library/Lattice_Syntax"
wenzelm@48481
   640
    "../Number_Theory/Primes"
wenzelm@48481
   641
  theories
wenzelm@61939
   642
    Knaster_Tarski
wenzelm@61939
   643
    Peirce
wenzelm@61939
   644
    Drinker
wenzelm@48481
   645
    Cantor
wenzelm@61938
   646
    Schroeder_Bernstein
wenzelm@61939
   647
    Structured_Statements
wenzelm@61939
   648
    Basic_Logic
wenzelm@48481
   649
    Expr_Compiler
wenzelm@48481
   650
    Fibonacci
wenzelm@48481
   651
    Group
wenzelm@48481
   652
    Group_Context
wenzelm@48481
   653
    Group_Notepad
wenzelm@48481
   654
    Hoare_Ex
wenzelm@48481
   655
    Mutilated_Checkerboard
wenzelm@48481
   656
    Puzzle
wenzelm@48481
   657
    Summation
wenzelm@61935
   658
    First_Order_Logic
wenzelm@61935
   659
    Higher_Order_Logic
wenzelm@56781
   660
  document_files
wenzelm@56781
   661
    "root.bib"
wenzelm@56781
   662
    "root.tex"
wenzelm@48481
   663
wenzelm@60119
   664
session "HOL-Eisbach" in Eisbach = HOL +
wenzelm@60119
   665
  description {*
wenzelm@60119
   666
    The Eisbach proof method language and "match" method.
wenzelm@60119
   667
  *}
wenzelm@60119
   668
  theories
wenzelm@60119
   669
    Eisbach
wenzelm@60119
   670
    Tests
wenzelm@60119
   671
    Examples
wenzelm@62168
   672
    Examples_FOL
wenzelm@60119
   673
wenzelm@48738
   674
session "HOL-SET_Protocol" in SET_Protocol = HOL +
wenzelm@51403
   675
  description {*
wenzelm@51403
   676
    Verification of the SET Protocol.
wenzelm@51403
   677
  *}
wenzelm@48481
   678
  theories [document = false] "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48481
   679
  theories SET_Protocol
wenzelm@56781
   680
  document_files "root.tex"
wenzelm@48481
   681
wenzelm@48738
   682
session "HOL-Matrix_LP" in Matrix_LP = HOL +
wenzelm@51403
   683
  description {*
wenzelm@51403
   684
    Two-dimensional matrices and linear programming.
wenzelm@51403
   685
  *}
wenzelm@48481
   686
  theories Cplex
wenzelm@56781
   687
  document_files "root.tex"
wenzelm@48481
   688
wenzelm@48738
   689
session "HOL-TLA" in TLA = HOL +
wenzelm@51403
   690
  description {*
wenzelm@51403
   691
    Lamport's Temporal Logic of Actions.
wenzelm@51403
   692
  *}
wenzelm@48483
   693
  options [document = false]
wenzelm@48481
   694
  theories TLA
wenzelm@48481
   695
wenzelm@48738
   696
session "HOL-TLA-Inc" in "TLA/Inc" = "HOL-TLA" +
wenzelm@48483
   697
  options [document = false]
wenzelm@48481
   698
  theories Inc
wenzelm@48481
   699
wenzelm@48738
   700
session "HOL-TLA-Buffer" in "TLA/Buffer" = "HOL-TLA" +
wenzelm@48483
   701
  options [document = false]
wenzelm@48481
   702
  theories DBuffer
wenzelm@48481
   703
wenzelm@48738
   704
session "HOL-TLA-Memory" in "TLA/Memory" = "HOL-TLA" +
wenzelm@48483
   705
  options [document = false]
wenzelm@48481
   706
  theories MemoryImplementation
wenzelm@48481
   707
wenzelm@48738
   708
session "HOL-TPTP" in TPTP = HOL +
wenzelm@48481
   709
  description {*
wenzelm@48481
   710
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   711
    Author:     Nik Sultana, University of Cambridge
wenzelm@48481
   712
    Copyright   2011
wenzelm@48481
   713
wenzelm@48481
   714
    TPTP-related extensions.
wenzelm@48481
   715
  *}
wenzelm@62354
   716
  options [document = false]
wenzelm@48481
   717
  theories
wenzelm@48481
   718
    ATP_Theory_Export
wenzelm@48481
   719
    MaSh_Eval
wenzelm@48481
   720
    TPTP_Interpret
wenzelm@48481
   721
    THF_Arith
sultana@55596
   722
    TPTP_Proof_Reconstruction
wenzelm@52488
   723
  theories
wenzelm@48481
   724
    ATP_Problem_Import
wenzelm@48481
   725
hoelzl@63627
   726
session "HOL-Analysis" (main) in Analysis = HOL +
wenzelm@48481
   727
  theories
hoelzl@63627
   728
    Analysis
wenzelm@56781
   729
  document_files
wenzelm@56781
   730
    "root.tex"
wenzelm@48481
   731
hoelzl@63627
   732
session "HOL-Analysis-ex" in "Analysis/ex" = "HOL-Analysis" +
wenzelm@59922
   733
  theories
wenzelm@59922
   734
    Approximations
wenzelm@59922
   735
hoelzl@63627
   736
session "HOL-Probability" in "Probability" = "HOL-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
blanchet@63731
   986
    Quickcheck_Nesting_Example
wenzelm@57584
   987
  theories [condition = ISABELLE_GHC]
Andreas@57544
   988
    Hotel_Example
wenzelm@48598
   989
    Quickcheck_Narrowing_Examples
wenzelm@48588
   990
wenzelm@48738
   991
session "HOL-Quotient_Examples" in Quotient_Examples = HOL +
wenzelm@48481
   992
  description {*
wenzelm@48481
   993
    Author:     Cezary Kaliszyk and Christian Urban
wenzelm@48481
   994
  *}
wenzelm@48483
   995
  options [document = false]
wenzelm@48481
   996
  theories
wenzelm@48481
   997
    DList
wenzelm@48481
   998
    FSet
wenzelm@48481
   999
    Quotient_Int
wenzelm@48481
  1000
    Quotient_Message
wenzelm@48481
  1001
    Lift_FSet
wenzelm@48481
  1002
    Lift_Set
wenzelm@48481
  1003
    Lift_Fun
wenzelm@48481
  1004
    Quotient_Rat
wenzelm@48481
  1005
    Lift_DList
kuncar@53682
  1006
    Int_Pow
kuncar@60237
  1007
    Lifting_Code_Dt_Test
wenzelm@48481
  1008
wenzelm@48738
  1009
session "HOL-Predicate_Compile_Examples" in Predicate_Compile_Examples = HOL +
wenzelm@48483
  1010
  options [document = false]
wenzelm@62354
  1011
  theories
wenzelm@48481
  1012
    Examples
wenzelm@48481
  1013
    Predicate_Compile_Tests
Andreas@61140
  1014
    Predicate_Compile_Quickcheck_Examples
wenzelm@48481
  1015
    Specialisation_Examples
wenzelm@48690
  1016
    IMP_1
wenzelm@48690
  1017
    IMP_2
wenzelm@55450
  1018
    (* FIXME since 21-Jul-2011
Andreas@61140
  1019
    Hotel_Example_Small_Generator *)
wenzelm@48690
  1020
    IMP_3
Andreas@61140
  1021
    IMP_4
wenzelm@62242
  1022
  theories [condition = ISABELLE_SWIPL]
wenzelm@48690
  1023
    Code_Prolog_Examples
wenzelm@48690
  1024
    Context_Free_Grammar_Example
wenzelm@48690
  1025
    Hotel_Example_Prolog
wenzelm@48690
  1026
    Lambda_Example
wenzelm@48690
  1027
    List_Examples
wenzelm@62242
  1028
  theories [condition = ISABELLE_SWIPL, quick_and_dirty]
wenzelm@48690
  1029
    Reg_Exp_Example
wenzelm@48481
  1030
wenzelm@48738
  1031
session HOLCF (main) in HOLCF = HOL +
wenzelm@48338
  1032
  description {*
wenzelm@48338
  1033
    Author:     Franz Regensburger
wenzelm@48338
  1034
    Author:     Brian Huffman
wenzelm@48338
  1035
wenzelm@48338
  1036
    HOLCF -- a semantic extension of HOL by the LCF logic.
wenzelm@48338
  1037
  *}
wenzelm@48470
  1038
  theories [document = false]
wenzelm@48338
  1039
    "~~/src/HOL/Library/Nat_Bijection"
wenzelm@48338
  1040
    "~~/src/HOL/Library/Countable"
wenzelm@48481
  1041
  theories
wenzelm@48481
  1042
    Plain_HOLCF
wenzelm@48481
  1043
    Fixrec
wenzelm@48481
  1044
    HOLCF
wenzelm@56781
  1045
  document_files "root.tex"
wenzelm@48481
  1046
wenzelm@48738
  1047
session "HOLCF-Tutorial" in "HOLCF/Tutorial" = HOLCF +
wenzelm@48481
  1048
  theories
wenzelm@48481
  1049
    Domain_ex
wenzelm@48481
  1050
    Fixrec_ex
wenzelm@48481
  1051
    New_Domain
wenzelm@56781
  1052
  document_files "root.tex"
wenzelm@48481
  1053
wenzelm@48738
  1054
session "HOLCF-Library" in "HOLCF/Library" = HOLCF +
wenzelm@48483
  1055
  options [document = false]
wenzelm@48481
  1056
  theories HOLCF_Library
wenzelm@48481
  1057
wenzelm@48738
  1058
session "HOLCF-IMP" in "HOLCF/IMP" = HOLCF +
wenzelm@51403
  1059
  description {*
wenzelm@51403
  1060
    IMP -- A WHILE-language and its Semantics.
wenzelm@51403
  1061
wenzelm@51403
  1062
    This is the HOLCF-based denotational semantics of a simple WHILE-language.
wenzelm@51403
  1063
  *}
wenzelm@48483
  1064
  options [document = false]
wenzelm@48481
  1065
  theories HoareEx
wenzelm@56781
  1066
  document_files "root.tex"
wenzelm@48338
  1067
wenzelm@48738
  1068
session "HOLCF-ex" in "HOLCF/ex" = HOLCF +
wenzelm@51421
  1069
  description {*
wenzelm@51421
  1070
    Miscellaneous examples for HOLCF.
wenzelm@51421
  1071
  *}
wenzelm@48483
  1072
  options [document = false]
wenzelm@48481
  1073
  theories
wenzelm@48481
  1074
    Dnat
wenzelm@48481
  1075
    Dagstuhl
wenzelm@48481
  1076
    Focus_ex
wenzelm@48481
  1077
    Fix2
wenzelm@48481
  1078
    Hoare
wenzelm@48481
  1079
    Concurrency_Monad
wenzelm@48481
  1080
    Loop
wenzelm@48481
  1081
    Powerdomain_ex
wenzelm@48481
  1082
    Domain_Proofs
wenzelm@48481
  1083
    Letrec
wenzelm@48481
  1084
    Pattern_Match
wenzelm@48481
  1085
wenzelm@48738
  1086
session "HOLCF-FOCUS" in "HOLCF/FOCUS" = HOLCF +
wenzelm@51403
  1087
  description {*
wenzelm@51403
  1088
    FOCUS: a theory of stream-processing functions Isabelle/HOLCF.
wenzelm@51403
  1089
wenzelm@51403
  1090
    For introductions to FOCUS, see
wenzelm@51403
  1091
wenzelm@51403
  1092
    "The Design of Distributed Systems - An Introduction to FOCUS"
wenzelm@51403
  1093
    http://www4.in.tum.de/publ/html.php?e=2
wenzelm@51403
  1094
wenzelm@51403
  1095
    "Specification and Refinement of a Buffer of Length One"
wenzelm@51403
  1096
    http://www4.in.tum.de/publ/html.php?e=15
wenzelm@51403
  1097
wenzelm@51403
  1098
    "Specification and Development of Interactive Systems: Focus on Streams,
wenzelm@51403
  1099
    Interfaces, and Refinement" http://www4.in.tum.de/publ/html.php?e=321
wenzelm@51403
  1100
  *}
wenzelm@48483
  1101
  options [document = false]
wenzelm@48481
  1102
  theories
wenzelm@48481
  1103
    Fstreams
wenzelm@48481
  1104
    FOCUS
wenzelm@48481
  1105
    Buffer_adm
wenzelm@48481
  1106
wenzelm@48738
  1107
session IOA in "HOLCF/IOA" = HOLCF +
wenzelm@48481
  1108
  description {*
wenzelm@48481
  1109
    Author:     Olaf Mueller
wenzelm@51403
  1110
    Copyright   1997 TU München
wenzelm@48481
  1111
wenzelm@51403
  1112
    A formalization of I/O automata in HOLCF.
wenzelm@51403
  1113
wenzelm@51403
  1114
    The distribution contains simulation relations, temporal logic, and an
wenzelm@51403
  1115
    abstraction theory. Everything is based upon a domain-theoretic model of
wenzelm@51403
  1116
    finite and infinite sequences.
wenzelm@48481
  1117
  *}
wenzelm@48483
  1118
  options [document = false]
wenzelm@62008
  1119
  theories "Abstraction"
wenzelm@48481
  1120
wenzelm@48738
  1121
session "IOA-ABP" in "HOLCF/IOA/ABP" = IOA +
wenzelm@48481
  1122
  description {*
wenzelm@48481
  1123
    Author:     Olaf Mueller
wenzelm@48481
  1124
wenzelm@48481
  1125
    The Alternating Bit Protocol performed in I/O-Automata.
wenzelm@48481
  1126
  *}
wenzelm@48483
  1127
  options [document = false]
wenzelm@59503
  1128
  theories
wenzelm@59503
  1129
    Correctness
wenzelm@59503
  1130
    Spec
wenzelm@48481
  1131
wenzelm@48738
  1132
session "IOA-NTP" in "HOLCF/IOA/NTP" = IOA +
wenzelm@48481
  1133
  description {*
wenzelm@48481
  1134
    Author:     Tobias Nipkow & Konrad Slind
wenzelm@48481
  1135
wenzelm@48481
  1136
    A network transmission protocol, performed in the
wenzelm@48481
  1137
    I/O automata formalization by Olaf Mueller.
wenzelm@48481
  1138
  *}
wenzelm@48483
  1139
  options [document = false]
wenzelm@48481
  1140
  theories Correctness
wenzelm@48481
  1141
wenzelm@48738
  1142
session "IOA-Storage" in "HOLCF/IOA/Storage" = IOA +
wenzelm@48481
  1143
  description {*
wenzelm@48481
  1144
    Author:     Olaf Mueller
wenzelm@48481
  1145
wenzelm@48481
  1146
    Memory storage case study.
wenzelm@48481
  1147
  *}
wenzelm@48483
  1148
  options [document = false]
wenzelm@48481
  1149
  theories Correctness
wenzelm@48481
  1150
wenzelm@48738
  1151
session "IOA-ex" in "HOLCF/IOA/ex" = IOA +
wenzelm@48481
  1152
  description {*
wenzelm@48481
  1153
    Author:     Olaf Mueller
wenzelm@48481
  1154
  *}
wenzelm@48483
  1155
  options [document = false]
wenzelm@48481
  1156
  theories
wenzelm@48481
  1157
    TrivEx
wenzelm@48481
  1158
    TrivEx2