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