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