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