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