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