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