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