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