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