src/HOL/ROOT
author wenzelm
Thu Dec 07 20:55:03 2017 +0100 (9 months ago)
changeset 67159 deccbba7cfe3
parent 67152 8021ea06aad8
child 67215 03d0c958d65a
permissions -rw-r--r--
more robust;
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@65374
     7
  theories
wenzelm@65374
     8
    Main (global)
wenzelm@65374
     9
    Complex_Main (global)
wenzelm@56781
    10
  document_files
wenzelm@56781
    11
    "root.bib"
wenzelm@56781
    12
    "root.tex"
wenzelm@48338
    13
wenzelm@63888
    14
session "HOL-Proofs" (timing) = Pure +
wenzelm@51421
    15
  description {*
wenzelm@51421
    16
    HOL-Main with explicit proof terms.
wenzelm@51421
    17
  *}
wenzelm@66946
    18
  options [quick_and_dirty = false, record_proofs = 2, parallel_proofs = 0]
wenzelm@65543
    19
  sessions
wenzelm@65543
    20
    "HOL-Library"
wenzelm@65530
    21
  theories
wenzelm@65530
    22
    "HOL-Library.Old_Datatype"
wenzelm@48338
    23
wenzelm@63888
    24
session "HOL-Library" (main timing) in Library = HOL +
wenzelm@51421
    25
  description {*
wenzelm@51421
    26
    Classical Higher-order Logic -- batteries included.
wenzelm@51421
    27
  *}
wenzelm@48481
    28
  theories
wenzelm@48481
    29
    Library
haftmann@64588
    30
    (*conflicting type class instantiations and dependent applications*)
haftmann@64588
    31
    Finite_Lattice
haftmann@64588
    32
    List_lexord
wenzelm@63763
    33
    Prefix_Order
haftmann@51115
    34
    Product_Lexorder
haftmann@51115
    35
    Product_Order
eberlm@65956
    36
    Subseq_Order
haftmann@51161
    37
    (*data refinements and dependent applications*)
haftmann@51161
    38
    AList_Mapping
haftmann@51161
    39
    Code_Binary_Nat
haftmann@51161
    40
    Code_Char
wenzelm@55447
    41
    Code_Prolog
wenzelm@48481
    42
    Code_Real_Approx_By_Float
haftmann@50023
    43
    Code_Target_Numeral
haftmann@51161
    44
    DAList
haftmann@54429
    45
    DAList_Multiset
haftmann@51161
    46
    RBT_Mapping
haftmann@51161
    47
    RBT_Set
haftmann@66015
    48
    (*printing modifications*)
haftmann@66015
    49
    OptionalSugar
haftmann@64588
    50
    (*prototypic tools*)
haftmann@64588
    51
    Predicate_Compile_Quickcheck
haftmann@51161
    52
    (*legacy tools*)
blanchet@58372
    53
    Old_Datatype
haftmann@51161
    54
    Old_Recdef
haftmann@64588
    55
    Refute
wenzelm@56781
    56
  document_files "root.bib" "root.tex"
wenzelm@48481
    57
wenzelm@66932
    58
session "HOL-Analysis" (main timing) in Analysis = HOL +
wenzelm@67152
    59
  options [document_tags = "unimportant",
wenzelm@67152
    60
    document_variants = "document:manual=-proof,-ML,-unimportant"]
wenzelm@66932
    61
  sessions
wenzelm@67152
    62
    "HOL-Library"
wenzelm@66932
    63
    "HOL-Computational_Algebra"
wenzelm@65375
    64
  theories
wenzelm@65462
    65
    Analysis
wenzelm@65375
    66
  document_files
wenzelm@65375
    67
    "root.tex"
wenzelm@65375
    68
wenzelm@65375
    69
session "HOL-Analysis-ex" in "Analysis/ex" = "HOL-Analysis" +
wenzelm@65375
    70
  theories
wenzelm@65375
    71
    Approximations
wenzelm@65375
    72
    Circle_Area
wenzelm@65375
    73
wenzelm@67100
    74
session "HOL-Computational_Algebra" (main timing) in "Computational_Algebra" = "HOL-Library" +
haftmann@65417
    75
  theories
haftmann@65417
    76
    Computational_Algebra
haftmann@65417
    77
    (*conflicting type class instantiations and dependent applications*)
haftmann@65417
    78
    Field_as_Ring
haftmann@65417
    79
wenzelm@65550
    80
session "HOL-Hahn_Banach" in Hahn_Banach = "HOL-Library" +
wenzelm@48481
    81
  description {*
wenzelm@48481
    82
    Author:     Gertrud Bauer, TU Munich
wenzelm@48481
    83
wenzelm@48481
    84
    The Hahn-Banach theorem for real vector spaces.
wenzelm@51403
    85
wenzelm@51403
    86
    This is the proof of the Hahn-Banach theorem for real vectorspaces,
wenzelm@51403
    87
    following H. Heuser, Funktionalanalysis, p. 228 -232. The Hahn-Banach
blanchet@55018
    88
    theorem is one of the fundamental theorems of functional analysis. It is a
wenzelm@51403
    89
    conclusion of Zorn's lemma.
wenzelm@51403
    90
wenzelm@51403
    91
    Two different formaulations of the theorem are presented, one for general
wenzelm@51403
    92
    real vectorspaces and its application to normed vectorspaces.
wenzelm@51403
    93
wenzelm@51403
    94
    The theorem says, that every continous linearform, defined on arbitrary
wenzelm@51403
    95
    subspaces (not only one-dimensional subspaces), can be extended to a
wenzelm@51403
    96
    continous linearform on the whole vectorspace.
wenzelm@48481
    97
  *}
wenzelm@65573
    98
  sessions
wenzelm@65573
    99
    "HOL-Analysis"
wenzelm@65543
   100
  theories
wenzelm@65543
   101
    Hahn_Banach
wenzelm@56781
   102
  document_files "root.bib" "root.tex"
wenzelm@48481
   103
wenzelm@65550
   104
session "HOL-Induct" in Induct = "HOL-Library" +
wenzelm@51403
   105
  description {*
wenzelm@51403
   106
    Examples of (Co)Inductive Definitions.
wenzelm@51403
   107
wenzelm@51403
   108
    Comb proves the Church-Rosser theorem for combinators (see
wenzelm@51403
   109
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR396-lcp-generic-automatic-proof-tools.ps.gz).
wenzelm@51403
   110
wenzelm@51403
   111
    Mutil is the famous Mutilated Chess Board problem (see
wenzelm@51403
   112
    http://www.cl.cam.ac.uk/ftp/papers/reports/TR394-lcp-mutilated-chess-board.dvi.gz).
wenzelm@51403
   113
wenzelm@51403
   114
    PropLog proves the completeness of a formalization of propositional logic
wenzelm@51403
   115
    (see
blanchet@58372
   116
    http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz).
wenzelm@51403
   117
wenzelm@51403
   118
    Exp demonstrates the use of iterated inductive definitions to reason about
wenzelm@51403
   119
    mutually recursive relations.
wenzelm@51403
   120
  *}
wenzelm@48481
   121
  theories [quick_and_dirty]
wenzelm@48481
   122
    Common_Patterns
wenzelm@48481
   123
  theories
wenzelm@61935
   124
    Nested_Datatype
wenzelm@48481
   125
    QuoDataType
wenzelm@48481
   126
    QuoNestedDataType
wenzelm@48481
   127
    Term
wenzelm@48481
   128
    SList
wenzelm@48481
   129
    ABexp
wenzelm@65562
   130
    Infinitely_Branching_Tree
wenzelm@48481
   131
    Ordinals
wenzelm@48481
   132
    Sigma_Algebra
wenzelm@48481
   133
    Comb
wenzelm@48481
   134
    PropLog
wenzelm@48481
   135
    Com
wenzelm@56781
   136
  document_files "root.tex"
wenzelm@48481
   137
wenzelm@65573
   138
session "HOL-IMP" (timing) in IMP = "HOL-Library" +
wenzelm@59446
   139
  options [document_variants = document]
wenzelm@48481
   140
  theories
wenzelm@48481
   141
    BExp
wenzelm@48481
   142
    ASM
nipkow@50050
   143
    Finite_Reachable
nipkow@52394
   144
    Denotational
nipkow@52400
   145
    Compiler2
wenzelm@48481
   146
    Poly_Types
wenzelm@48481
   147
    Sec_Typing
wenzelm@48481
   148
    Sec_TypingT
nipkow@52726
   149
    Def_Init_Big
nipkow@52726
   150
    Def_Init_Small
nipkow@52726
   151
    Fold
wenzelm@48481
   152
    Live
wenzelm@48481
   153
    Live_True
wenzelm@48481
   154
    Hoare_Examples
nipkow@63538
   155
    Hoare_Sound_Complete
nipkow@52269
   156
    VCG
nipkow@52282
   157
    Hoare_Total
nipkow@63538
   158
    VCG_Total_EX
nipkow@67019
   159
    VCG_Total_EX2
wenzelm@48481
   160
    Collecting1
nipkow@48765
   161
    Collecting_Examples
wenzelm@48481
   162
    Abs_Int_Tests
wenzelm@48481
   163
    Abs_Int1_parity
wenzelm@48481
   164
    Abs_Int1_const
wenzelm@48481
   165
    Abs_Int3
wenzelm@48481
   166
    Procs_Dyn_Vars_Dyn
wenzelm@48481
   167
    Procs_Stat_Vars_Dyn
wenzelm@48481
   168
    Procs_Stat_Vars_Stat
wenzelm@48481
   169
    C_like
wenzelm@48481
   170
    OO
wenzelm@56781
   171
  document_files "root.bib" "root.tex"
wenzelm@48481
   172
wenzelm@48738
   173
session "HOL-IMPP" in IMPP = HOL +
wenzelm@48481
   174
  description {*
wenzelm@48481
   175
    Author:     David von Oheimb
wenzelm@48481
   176
    Copyright   1999 TUM
wenzelm@51403
   177
wenzelm@51403
   178
    IMPP -- An imperative language with procedures.
wenzelm@51403
   179
wenzelm@51403
   180
    This is an extension of IMP with local variables and mutually recursive
wenzelm@51403
   181
    procedures. For documentation see "Hoare Logic for Mutual Recursion and
wenzelm@51403
   182
    Local Variables" (http://isabelle.in.tum.de/Bali/papers/FSTTCS99.html).
wenzelm@48481
   183
  *}
wenzelm@48481
   184
  theories EvenOdd
wenzelm@48481
   185
wenzelm@63888
   186
session "HOL-Data_Structures" (timing) in Data_Structures = HOL +
nipkow@61203
   187
  options [document_variants = document]
wenzelm@65573
   188
  sessions
wenzelm@65573
   189
    "HOL-Number_Theory"
nipkow@61203
   190
  theories [document = false]
wenzelm@65538
   191
    Less_False
nipkow@61203
   192
  theories
nipkow@66543
   193
    Sorting
nipkow@63829
   194
    Balance
nipkow@61203
   195
    Tree_Map
nipkow@61232
   196
    AVL_Map
nipkow@61224
   197
    RBT_Map
nipkow@61469
   198
    Tree23_Map
nipkow@61514
   199
    Tree234_Map
nipkow@61789
   200
    Brother12_Map
nipkow@62130
   201
    AA_Map
nipkow@62706
   202
    Leftist_Heap
nipkow@66434
   203
    Binomial_Heap
nipkow@61224
   204
  document_files "root.tex" "root.bib"
nipkow@61203
   205
wenzelm@48738
   206
session "HOL-Import" in Import = HOL +
wenzelm@48481
   207
  theories HOL_Light_Maps
wenzelm@48481
   208
  theories [condition = HOL_LIGHT_BUNDLE] HOL_Light_Import
wenzelm@48481
   209
wenzelm@67100
   210
session "HOL-Number_Theory" (main timing) in Number_Theory = "HOL-Computational_Algebra" +
lp15@55321
   211
  description {*
lp15@55321
   212
    Fundamental Theorem of Arithmetic, Chinese Remainder Theorem, Fermat/Euler
lp15@55730
   213
    Theorem, Wilson's Theorem, some lemmas for Quadratic Reciprocity.
lp15@55321
   214
  *}
wenzelm@65543
   215
  sessions
wenzelm@65543
   216
    "HOL-Algebra"
lp15@55321
   217
  theories
lp15@55321
   218
    Number_Theory
wenzelm@56781
   219
  document_files
wenzelm@56781
   220
    "root.tex"
wenzelm@48481
   221
wenzelm@48738
   222
session "HOL-Hoare" in Hoare = HOL +
wenzelm@51403
   223
  description {*
wenzelm@51403
   224
    Verification of imperative programs (verification conditions are generated
wenzelm@51403
   225
    automatically from pre/post conditions and loop invariants).
wenzelm@51403
   226
  *}
wenzelm@48481
   227
  theories Hoare
wenzelm@56781
   228
  document_files "root.bib" "root.tex"
wenzelm@48481
   229
wenzelm@63888
   230
session "HOL-Hoare_Parallel" (timing) in Hoare_Parallel = HOL +
wenzelm@51403
   231
  description {*
wenzelm@51403
   232
    Verification of shared-variable imperative programs a la Owicki-Gries.
wenzelm@51403
   233
    (verification conditions are generated automatically).
wenzelm@51403
   234
  *}
wenzelm@48481
   235
  theories Hoare_Parallel
wenzelm@56781
   236
  document_files "root.bib" "root.tex"
wenzelm@48481
   237
wenzelm@65550
   238
session "HOL-Codegenerator_Test" in Codegenerator_Test = "HOL-Number_Theory" +
wenzelm@65573
   239
  sessions
wenzelm@65573
   240
    "HOL-Data_Structures"
wenzelm@65573
   241
    "HOL-ex"
wenzelm@51422
   242
  theories
wenzelm@51422
   243
    Generate
wenzelm@51422
   244
    Generate_Binary_Nat
wenzelm@51422
   245
    Generate_Target_Nat
wenzelm@51422
   246
    Generate_Efficient_Datastructures
wenzelm@51422
   247
    Generate_Pretty_Char
wenzelm@64582
   248
    Code_Test_PolyML
wenzelm@64582
   249
    Code_Test_Scala
wenzelm@66842
   250
  theories [condition = ISABELLE_GHC]
Andreas@58039
   251
    Code_Test_GHC
wenzelm@66842
   252
  theories [condition = ISABELLE_MLTON]
Andreas@58039
   253
    Code_Test_MLton
wenzelm@66842
   254
  theories [condition = ISABELLE_OCAMLC]
Andreas@58039
   255
    Code_Test_OCaml
wenzelm@66842
   256
  theories [condition = ISABELLE_SMLNJ]
Andreas@58039
   257
    Code_Test_SMLNJ
wenzelm@48481
   258
wenzelm@65573
   259
session "HOL-Metis_Examples" (timing) in Metis_Examples = "HOL-Library" +
wenzelm@48481
   260
  description {*
wenzelm@48481
   261
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   262
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   263
wenzelm@48481
   264
    Testing Metis and Sledgehammer.
wenzelm@48481
   265
  *}
wenzelm@65573
   266
  sessions
wenzelm@65573
   267
    "HOL-Decision_Procs"
wenzelm@48481
   268
  theories
wenzelm@48481
   269
    Abstraction
wenzelm@48481
   270
    Big_O
wenzelm@48481
   271
    Binary_Tree
wenzelm@48481
   272
    Clausification
wenzelm@48481
   273
    Message
wenzelm@48481
   274
    Proxies
wenzelm@48481
   275
    Tarski
wenzelm@48481
   276
    Trans_Closure
wenzelm@48481
   277
    Sets
wenzelm@48481
   278
wenzelm@65573
   279
session "HOL-Nitpick_Examples" in Nitpick_Examples = "HOL-Library" +
wenzelm@48481
   280
  description {*
wenzelm@48481
   281
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   282
    Copyright   2009
wenzelm@48481
   283
  *}
wenzelm@48481
   284
  theories [quick_and_dirty] Nitpick_Examples
wenzelm@48481
   285
wenzelm@65550
   286
session "HOL-Algebra" (main timing) in Algebra = "HOL-Computational_Algebra" +
wenzelm@48481
   287
  description {*
wenzelm@48481
   288
    Author: Clemens Ballarin, started 24 September 1999
wenzelm@48481
   289
wenzelm@48481
   290
    The Isabelle Algebraic Library.
wenzelm@48481
   291
  *}
wenzelm@48481
   292
  theories
ballarin@65099
   293
    (* Orders and Lattices *)
ballarin@65099
   294
    Galois_Connection    (* Knaster-Tarski theorem and Galois connections *)
ballarin@65099
   295
wenzelm@48481
   296
    (* Groups *)
wenzelm@48481
   297
    FiniteProduct        (* Product operator for commutative groups *)
wenzelm@48481
   298
    Sylow                (* Sylow's theorem *)
wenzelm@48481
   299
    Bij                  (* Automorphism Groups *)
haftmann@65416
   300
    More_Group
haftmann@65416
   301
    More_Finite_Product
haftmann@65416
   302
    Multiplicative_Group
wenzelm@48481
   303
wenzelm@48481
   304
    (* Rings *)
wenzelm@48481
   305
    Divisibility         (* Rings *)
wenzelm@48481
   306
    IntRing              (* Ideals and residue classes *)
wenzelm@48481
   307
    UnivPoly             (* Polynomials *)
haftmann@65416
   308
    More_Ring
wenzelm@56781
   309
  document_files "root.bib" "root.tex"
wenzelm@48481
   310
wenzelm@65573
   311
session "HOL-Auth" (timing) in Auth = "HOL-Library" +
wenzelm@51421
   312
  description {*
wenzelm@51421
   313
    A new approach to verifying authentication protocols.
wenzelm@51421
   314
  *}
wenzelm@48481
   315
  theories
wenzelm@48481
   316
    Auth_Shared
wenzelm@48481
   317
    Auth_Public
wenzelm@48481
   318
    "Smartcard/Auth_Smartcard"
wenzelm@48481
   319
    "Guard/Auth_Guard_Shared"
wenzelm@48481
   320
    "Guard/Auth_Guard_Public"
wenzelm@56781
   321
  document_files "root.tex"
wenzelm@48481
   322
wenzelm@63888
   323
session "HOL-UNITY" (timing) in UNITY = "HOL-Auth" +
wenzelm@48481
   324
  description {*
wenzelm@48481
   325
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@48481
   326
    Copyright   1998  University of Cambridge
wenzelm@48481
   327
wenzelm@51403
   328
    Verifying security protocols using Chandy and Misra's UNITY formalism.
wenzelm@48481
   329
  *}
wenzelm@48481
   330
  theories
wenzelm@48481
   331
    (*Basic meta-theory*)
wenzelm@65538
   332
    UNITY_Main
wenzelm@48481
   333
wenzelm@48481
   334
    (*Simple examples: no composition*)
wenzelm@48481
   335
    "Simple/Deadlock"
wenzelm@48481
   336
    "Simple/Common"
wenzelm@48481
   337
    "Simple/Network"
wenzelm@48481
   338
    "Simple/Token"
wenzelm@48481
   339
    "Simple/Channel"
wenzelm@48481
   340
    "Simple/Lift"
wenzelm@48481
   341
    "Simple/Mutex"
wenzelm@48481
   342
    "Simple/Reach"
wenzelm@48481
   343
    "Simple/Reachability"
wenzelm@48481
   344
wenzelm@48481
   345
    (*Verifying security protocols using UNITY*)
wenzelm@48481
   346
    "Simple/NSP_Bad"
wenzelm@48481
   347
wenzelm@48481
   348
    (*Example of composition*)
wenzelm@48481
   349
    "Comp/Handshake"
wenzelm@48481
   350
wenzelm@48481
   351
    (*Universal properties examples*)
wenzelm@48481
   352
    "Comp/Counter"
wenzelm@48481
   353
    "Comp/Counterc"
wenzelm@48481
   354
    "Comp/Priority"
wenzelm@48481
   355
wenzelm@48481
   356
    "Comp/TimerArray"
wenzelm@48481
   357
    "Comp/Progress"
wenzelm@48481
   358
wenzelm@48481
   359
    "Comp/Alloc"
wenzelm@48481
   360
    "Comp/AllocImpl"
wenzelm@48481
   361
    "Comp/Client"
wenzelm@48481
   362
wenzelm@48481
   363
    (*obsolete*)
wenzelm@65538
   364
    ELT
wenzelm@56781
   365
  document_files "root.tex"
wenzelm@48481
   366
wenzelm@65573
   367
session "HOL-Unix" in Unix = "HOL-Library" +
wenzelm@48481
   368
  options [print_mode = "no_brackets,no_type_brackets"]
wenzelm@48481
   369
  theories Unix
wenzelm@56781
   370
  document_files "root.bib" "root.tex"
wenzelm@48481
   371
wenzelm@65573
   372
session "HOL-ZF" in ZF = "HOL-Library" +
wenzelm@65573
   373
  theories
wenzelm@65573
   374
    MainZF
wenzelm@65573
   375
    Games
wenzelm@56781
   376
  document_files "root.tex"
wenzelm@48481
   377
wenzelm@66986
   378
session "HOL-Imperative_HOL" (timing) in Imperative_HOL = "HOL-Library" +
wenzelm@59446
   379
  options [print_mode = "iff,no_brackets"]
wenzelm@48481
   380
  theories Imperative_HOL_ex
wenzelm@56781
   381
  document_files "root.bib" "root.tex"
wenzelm@48481
   382
wenzelm@65550
   383
session "HOL-Decision_Procs" (timing) in Decision_Procs = "HOL-Algebra" +
wenzelm@51544
   384
  description {*
wenzelm@51544
   385
    Various decision procedures, typically involving reflection.
wenzelm@51544
   386
  *}
wenzelm@65543
   387
  theories
wenzelm@65543
   388
    Decision_Procs
wenzelm@48481
   389
lars@63000
   390
session "HOL-Proofs-ex" in "Proofs/ex" = "HOL-Proofs" +
wenzelm@65573
   391
  sessions
wenzelm@65573
   392
    "HOL-Isar_Examples"
wenzelm@52424
   393
  theories
wenzelm@52424
   394
    Hilbert_Classical
wenzelm@62363
   395
    Proof_Terms
wenzelm@52424
   396
    XML_Data
wenzelm@48481
   397
wenzelm@63888
   398
session "HOL-Proofs-Extraction" (timing) in "Proofs/Extraction" = "HOL-Proofs" +
wenzelm@51421
   399
  description {*
wenzelm@51421
   400
    Examples for program extraction in Higher-Order Logic.
wenzelm@51421
   401
  *}
wenzelm@62354
   402
  options [parallel_proofs = 0, quick_and_dirty = false]
wenzelm@65543
   403
  sessions
wenzelm@65543
   404
    "HOL-Computational_Algebra"
wenzelm@48481
   405
  theories
wenzelm@48481
   406
    Greatest_Common_Divisor
wenzelm@48481
   407
    Warshall
wenzelm@48481
   408
    Higman_Extraction
wenzelm@48481
   409
    Pigeonhole
wenzelm@48481
   410
    Euclid
wenzelm@56781
   411
  document_files "root.bib" "root.tex"
wenzelm@48481
   412
wenzelm@63888
   413
session "HOL-Proofs-Lambda" (timing) in "Proofs/Lambda" = "HOL-Proofs" +
wenzelm@51403
   414
  description {*
wenzelm@51403
   415
    Lambda Calculus in de Bruijn's Notation.
wenzelm@51403
   416
wenzelm@51403
   417
    This session defines lambda-calculus terms with de Bruijn indixes and
wenzelm@51403
   418
    proves confluence of beta, eta and beta+eta.
wenzelm@51403
   419
wenzelm@51403
   420
    The paper "More Church-Rosser Proofs (in Isabelle/HOL)" describes the whole
wenzelm@51403
   421
    theory (see http://www.in.tum.de/~nipkow/pubs/jar2001.html).
wenzelm@51403
   422
  *}
wenzelm@62354
   423
  options [print_mode = "no_brackets",
wenzelm@62242
   424
    parallel_proofs = 0, quick_and_dirty = false]
wenzelm@65543
   425
  sessions
wenzelm@65543
   426
    "HOL-Library"
wenzelm@48481
   427
  theories
wenzelm@48481
   428
    Eta
wenzelm@48481
   429
    StrongNorm
wenzelm@48481
   430
    Standardization
wenzelm@48481
   431
    WeakNorm
wenzelm@56781
   432
  document_files "root.bib" "root.tex"
wenzelm@48481
   433
wenzelm@48738
   434
session "HOL-Prolog" in Prolog = HOL +
wenzelm@48481
   435
  description {*
wenzelm@48481
   436
    Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
wenzelm@51403
   437
wenzelm@51403
   438
    A bare-bones implementation of Lambda-Prolog.
wenzelm@51403
   439
wenzelm@51403
   440
    This is a simple exploratory implementation of Lambda-Prolog in HOL,
wenzelm@51403
   441
    including some minimal examples (in Test.thy) and a more typical example of
wenzelm@51403
   442
    a little functional language and its type system.
wenzelm@48481
   443
  *}
wenzelm@48481
   444
  theories Test Type
wenzelm@48481
   445
wenzelm@65550
   446
session "HOL-MicroJava" (timing) in MicroJava = "HOL-Library" +
wenzelm@51403
   447
  description {*
wenzelm@51403
   448
    Formalization of a fragment of Java, together with a corresponding virtual
wenzelm@51403
   449
    machine and a specification of its bytecode verifier and a lightweight
wenzelm@51403
   450
    bytecode verifier, including proofs of type-safety.
wenzelm@51403
   451
  *}
wenzelm@65573
   452
  sessions
wenzelm@65573
   453
    "HOL-Eisbach"
wenzelm@59446
   454
  theories
wenzelm@59446
   455
    MicroJava
wenzelm@56781
   456
  document_files
wenzelm@56781
   457
    "introduction.tex"
wenzelm@56781
   458
    "root.bib"
wenzelm@56781
   459
    "root.tex"
wenzelm@48481
   460
wenzelm@48738
   461
session "HOL-NanoJava" in NanoJava = HOL +
wenzelm@51403
   462
  description {*
wenzelm@51403
   463
    Hoare Logic for a tiny fragment of Java.
wenzelm@51403
   464
  *}
wenzelm@48481
   465
  theories Example
wenzelm@56781
   466
  document_files "root.bib" "root.tex"
wenzelm@48481
   467
wenzelm@65573
   468
session "HOL-Bali" (timing) in Bali = "HOL-Library" +
wenzelm@48481
   469
  theories
wenzelm@48481
   470
    AxExample
wenzelm@48481
   471
    AxSound
wenzelm@48481
   472
    AxCompl
wenzelm@48481
   473
    Trans
wenzelm@60751
   474
    TypeSafe
wenzelm@56781
   475
  document_files "root.tex"
wenzelm@48481
   476
wenzelm@48738
   477
session "HOL-IOA" in IOA = HOL +
wenzelm@48481
   478
  description {*
wenzelm@51403
   479
    Author:     Tobias Nipkow and Konrad Slind and Olaf Müller
wenzelm@51403
   480
    Copyright   1994--1996  TU Muenchen
wenzelm@48481
   481
blanchet@55417
   482
    The meta-theory of I/O-Automata in HOL. This formalization has been
wenzelm@51403
   483
    significantly changed and extended, see HOLCF/IOA. There are also the
wenzelm@51403
   484
    proofs of two communication protocols which formerly have been here.
wenzelm@48481
   485
wenzelm@48481
   486
    @inproceedings{Nipkow-Slind-IOA,
wenzelm@48481
   487
    author={Tobias Nipkow and Konrad Slind},
wenzelm@48481
   488
    title={{I/O} Automata in {Isabelle/HOL}},
wenzelm@48481
   489
    booktitle={Proc.\ TYPES Workshop 1994},
wenzelm@48481
   490
    publisher=Springer,
wenzelm@48481
   491
    series=LNCS,
wenzelm@48481
   492
    note={To appear}}
wenzelm@48481
   493
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/ioa.ps.gz
wenzelm@48481
   494
wenzelm@48481
   495
    and
wenzelm@48481
   496
wenzelm@48481
   497
    @inproceedings{Mueller-Nipkow,
wenzelm@48481
   498
    author={Olaf M\"uller and Tobias Nipkow},
wenzelm@48481
   499
    title={Combining Model Checking and Deduction for {I/O}-Automata},
wenzelm@48481
   500
    booktitle={Proc.\ TACAS Workshop},
wenzelm@48481
   501
    organization={Aarhus University, BRICS report},
wenzelm@48481
   502
    year=1995}
wenzelm@48481
   503
    ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/tacas.dvi.gz
wenzelm@48481
   504
  *}
wenzelm@48481
   505
  theories Solve
wenzelm@48481
   506
wenzelm@48738
   507
session "HOL-Lattice" in Lattice = HOL +
wenzelm@48481
   508
  description {*
wenzelm@48481
   509
    Author:     Markus Wenzel, TU Muenchen
wenzelm@48481
   510
wenzelm@48481
   511
    Basic theory of lattices and orders.
wenzelm@48481
   512
  *}
wenzelm@48481
   513
  theories CompleteLattice
wenzelm@56781
   514
  document_files "root.tex"
wenzelm@48481
   515
wenzelm@66752
   516
session "HOL-ex" (timing) in ex = "HOL-Number_Theory" +
wenzelm@51421
   517
  description {*
wenzelm@51421
   518
    Miscellaneous examples for Higher-Order Logic.
wenzelm@51421
   519
  *}
wenzelm@65548
   520
  theories
wenzelm@65549
   521
    Adhoc_Overloading_Examples
wenzelm@65549
   522
    Antiquote
wenzelm@65549
   523
    Argo_Examples
wenzelm@65549
   524
    Arith_Examples
wenzelm@65549
   525
    Ballot
wenzelm@65549
   526
    BinEx
wenzelm@65549
   527
    Birthday_Paradox
wenzelm@65549
   528
    Bubblesort
wenzelm@65549
   529
    CTL
wenzelm@65549
   530
    Cartouche_Examples
wenzelm@65563
   531
    Case_Product
wenzelm@65549
   532
    Chinese
wenzelm@65549
   533
    Classical
haftmann@50023
   534
    Code_Binary_Nat_examples
wenzelm@65549
   535
    Code_Timing
wenzelm@65549
   536
    Coercion_Examples
wenzelm@65549
   537
    Coherent
wenzelm@65549
   538
    Commands
wenzelm@65549
   539
    Computations
wenzelm@65549
   540
    Cubic_Quartic
wenzelm@65549
   541
    Dedekind_Real
wenzelm@65549
   542
    Erdoes_Szekeres
wenzelm@48481
   543
    Eval_Examples
wenzelm@65549
   544
    Executable_Relation
wenzelm@65549
   545
    Execute_Choice
wenzelm@65549
   546
    Functions
haftmann@66797
   547
    Function_Growth
wenzelm@65549
   548
    Gauge_Integration
wenzelm@65549
   549
    Groebner_Examples
wenzelm@65549
   550
    Guess
wenzelm@65549
   551
    HarmonicSeries
wenzelm@65549
   552
    Hebrew
wenzelm@65549
   553
    Hex_Bin_Examples
wenzelm@65549
   554
    IArray_Examples
wenzelm@65549
   555
    Iff_Oracle
wenzelm@65549
   556
    Induction_Schema
wenzelm@65549
   557
    Intuitionistic
wenzelm@65549
   558
    Lagrange
wenzelm@65549
   559
    List_to_Set_Comprehension_Examples
wenzelm@65549
   560
    LocaleTest2
wenzelm@65549
   561
    ML
wenzelm@65549
   562
    MergeSort
wenzelm@65549
   563
    MonoidGroup
wenzelm@65549
   564
    Multiquote
wenzelm@65549
   565
    NatSum
wenzelm@48481
   566
    Normalization_by_Evaluation
wenzelm@65549
   567
    PER
wenzelm@65549
   568
    Parallel_Example
wenzelm@65549
   569
    Peano_Axioms
wenzelm@65549
   570
    Perm_Fragments
wenzelm@65549
   571
    PresburgerEx
wenzelm@65549
   572
    Primrec
wenzelm@65549
   573
    Pythagoras
wenzelm@65549
   574
    Quicksort
wenzelm@65549
   575
    Records
wenzelm@65549
   576
    Reflection_Examples
wenzelm@65549
   577
    Refute_Examples
wenzelm@65549
   578
    Rewrite_Examples
wenzelm@65549
   579
    SOS
wenzelm@65549
   580
    SOS_Cert
wenzelm@65549
   581
    Seq
wenzelm@48481
   582
    Serbian
wenzelm@65549
   583
    Set_Comprehension_Pointfree_Examples
wenzelm@48481
   584
    Set_Theory
wenzelm@65549
   585
    Simproc_Tests
wenzelm@65549
   586
    Simps_Case_Conv_Examples
wenzelm@48481
   587
    Sqrt
wenzelm@48481
   588
    Sqrt_Script
wenzelm@65549
   589
    Sudoku
wenzelm@65549
   590
    Sum_of_Powers
wenzelm@65549
   591
    Tarski
wenzelm@65549
   592
    Termination
wenzelm@65549
   593
    ThreeDivides
kuncar@61368
   594
    Transfer_Debug
wenzelm@48481
   595
    Transfer_Int_Nat
haftmann@56922
   596
    Transitive_Closure_Table_Ex
wenzelm@65549
   597
    Tree23
wenzelm@65549
   598
    Unification
wenzelm@65549
   599
    While_Combinator_Example
haftmann@64015
   600
    Word_Type
blanchet@64978
   601
    veriT_Preprocessing
wenzelm@51558
   602
  theories [skip_proofs = false]
wenzelm@67159
   603
    SAT_Examples
wenzelm@51558
   604
    Meson_Test
wenzelm@48481
   605
wenzelm@65550
   606
session "HOL-Isar_Examples" in Isar_Examples = "HOL-Computational_Algebra" +
wenzelm@51403
   607
  description {*
wenzelm@61935
   608
    Miscellaneous Isabelle/Isar examples.
wenzelm@51403
   609
  *}
wenzelm@61939
   610
  options [quick_and_dirty]
wenzelm@48481
   611
  theories
wenzelm@61939
   612
    Knaster_Tarski
wenzelm@61939
   613
    Peirce
wenzelm@61939
   614
    Drinker
wenzelm@48481
   615
    Cantor
wenzelm@61939
   616
    Structured_Statements
wenzelm@61939
   617
    Basic_Logic
wenzelm@48481
   618
    Expr_Compiler
wenzelm@48481
   619
    Fibonacci
wenzelm@48481
   620
    Group
wenzelm@48481
   621
    Group_Context
wenzelm@48481
   622
    Group_Notepad
wenzelm@48481
   623
    Hoare_Ex
wenzelm@48481
   624
    Mutilated_Checkerboard
wenzelm@48481
   625
    Puzzle
wenzelm@48481
   626
    Summation
wenzelm@61935
   627
    First_Order_Logic
wenzelm@61935
   628
    Higher_Order_Logic
wenzelm@56781
   629
  document_files
wenzelm@56781
   630
    "root.bib"
wenzelm@56781
   631
    "root.tex"
wenzelm@48481
   632
wenzelm@60119
   633
session "HOL-Eisbach" in Eisbach = HOL +
wenzelm@60119
   634
  description {*
wenzelm@60119
   635
    The Eisbach proof method language and "match" method.
wenzelm@60119
   636
  *}
wenzelm@66444
   637
  sessions
wenzelm@66444
   638
    FOL
wenzelm@60119
   639
  theories
wenzelm@60119
   640
    Eisbach
wenzelm@60119
   641
    Tests
wenzelm@60119
   642
    Examples
wenzelm@62168
   643
    Examples_FOL
wenzelm@60119
   644
wenzelm@65550
   645
session "HOL-SET_Protocol" (timing) in SET_Protocol = "HOL-Library" +
wenzelm@51403
   646
  description {*
wenzelm@51403
   647
    Verification of the SET Protocol.
wenzelm@51403
   648
  *}
wenzelm@65543
   649
  theories
wenzelm@65543
   650
    SET_Protocol
wenzelm@56781
   651
  document_files "root.tex"
wenzelm@48481
   652
wenzelm@65569
   653
session "HOL-Matrix_LP" in Matrix_LP = "HOL-Library" +
wenzelm@51403
   654
  description {*
wenzelm@51403
   655
    Two-dimensional matrices and linear programming.
wenzelm@51403
   656
  *}
wenzelm@48481
   657
  theories Cplex
wenzelm@56781
   658
  document_files "root.tex"
wenzelm@48481
   659
wenzelm@48738
   660
session "HOL-TLA" in TLA = HOL +
wenzelm@51403
   661
  description {*
wenzelm@51403
   662
    Lamport's Temporal Logic of Actions.
wenzelm@51403
   663
  *}
wenzelm@48481
   664
  theories TLA
wenzelm@48481
   665
wenzelm@48738
   666
session "HOL-TLA-Inc" in "TLA/Inc" = "HOL-TLA" +
wenzelm@48481
   667
  theories Inc
wenzelm@48481
   668
wenzelm@48738
   669
session "HOL-TLA-Buffer" in "TLA/Buffer" = "HOL-TLA" +
wenzelm@48481
   670
  theories DBuffer
wenzelm@48481
   671
wenzelm@48738
   672
session "HOL-TLA-Memory" in "TLA/Memory" = "HOL-TLA" +
wenzelm@48481
   673
  theories MemoryImplementation
wenzelm@48481
   674
wenzelm@65573
   675
session "HOL-TPTP" in TPTP = "HOL-Library" +
wenzelm@48481
   676
  description {*
wenzelm@48481
   677
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@48481
   678
    Author:     Nik Sultana, University of Cambridge
wenzelm@48481
   679
    Copyright   2011
wenzelm@48481
   680
wenzelm@48481
   681
    TPTP-related extensions.
wenzelm@48481
   682
  *}
wenzelm@48481
   683
  theories
wenzelm@48481
   684
    ATP_Theory_Export
wenzelm@48481
   685
    MaSh_Eval
wenzelm@48481
   686
    TPTP_Interpret
wenzelm@48481
   687
    THF_Arith
sultana@55596
   688
    TPTP_Proof_Reconstruction
wenzelm@52488
   689
  theories
wenzelm@48481
   690
    ATP_Problem_Import
wenzelm@48481
   691
wenzelm@65382
   692
session "HOL-Probability" (main timing) in "Probability" = "HOL-Analysis" +
wenzelm@48481
   693
  theories
wenzelm@66992
   694
    Probability
wenzelm@56781
   695
  document_files "root.tex"
wenzelm@48481
   696
wenzelm@63888
   697
session "HOL-Probability-ex" (timing) in "Probability/ex" = "HOL-Probability" +
haftmann@61946
   698
  theories
wenzelm@65538
   699
    Dining_Cryptographers
wenzelm@65538
   700
    Koepf_Duermuth_Countermeasure
wenzelm@65538
   701
    Measure_Not_CCC
haftmann@61946
   702
wenzelm@66752
   703
session "HOL-Nominal" in Nominal = "HOL-Library" +
wenzelm@65573
   704
  theories
wenzelm@65573
   705
    Nominal
wenzelm@48481
   706
wenzelm@63888
   707
session "HOL-Nominal-Examples" (timing) in "Nominal/Examples" = "HOL-Nominal" +
blanchet@58329
   708
  theories
wenzelm@59162
   709
    Class3
wenzelm@59162
   710
    CK_Machine
wenzelm@59162
   711
    Compile
wenzelm@59162
   712
    Contexts
wenzelm@59162
   713
    Crary
wenzelm@59162
   714
    CR_Takahashi
wenzelm@59162
   715
    CR
wenzelm@59162
   716
    Fsub
wenzelm@59162
   717
    Height
wenzelm@59162
   718
    Lambda_mu
wenzelm@59162
   719
    Lam_Funs
wenzelm@59162
   720
    LocalWeakening
wenzelm@59162
   721
    Pattern
wenzelm@59162
   722
    SN
wenzelm@59162
   723
    SOS
wenzelm@59162
   724
    Standardization
wenzelm@59162
   725
    Support
wenzelm@59162
   726
    Type_Preservation
wenzelm@59162
   727
    Weakening
wenzelm@59162
   728
    W
blanchet@58329
   729
  theories [quick_and_dirty]
blanchet@58329
   730
    VC_Condition
wenzelm@48481
   731
wenzelm@65573
   732
session "HOL-Cardinals" (timing) in Cardinals = "HOL-Library" +
wenzelm@51421
   733
  description {*
wenzelm@51421
   734
    Ordinals and Cardinals, Full Theories.
wenzelm@51421
   735
  *}
traytel@59747
   736
  theories
traytel@59747
   737
    Cardinals
traytel@59747
   738
    Bounded_Set
wenzelm@56781
   739
  document_files
wenzelm@56781
   740
    "intro.tex"
wenzelm@56781
   741
    "root.tex"
wenzelm@56781
   742
    "root.bib"
blanchet@48975
   743
wenzelm@65574
   744
session "HOL-Datatype_Examples" (timing) in Datatype_Examples = "HOL-Library" +
wenzelm@51421
   745
  description {*
wenzelm@62286
   746
    (Co)datatype Examples.
wenzelm@51421
   747
  *}
blanchet@48975
   748
  theories
blanchet@56454
   749
    Compat
blanchet@48975
   750
    Lambda_Term
blanchet@48975
   751
    Process
blanchet@48975
   752
    TreeFsetI
popescua@49872
   753
    "Derivation_Trees/Gram_Lang"
wenzelm@65574
   754
    "Derivation_Trees/Parallel_Composition"
traytel@50517
   755
    Koenig
traytel@60921
   756
    Lift_BNF
traytel@61745
   757
    Milner_Tofte
traytel@54961
   758
    Stream_Processor
blanchet@53122
   759
    Misc_Codatatype
blanchet@53122
   760
    Misc_Datatype
blanchet@54193
   761
    Misc_Primcorec
blanchet@53306
   762
    Misc_Primrec
blanchet@48975
   763
wenzelm@65573
   764
session "HOL-Corec_Examples" (timing) in Corec_Examples = "HOL-Library" +
blanchet@62694
   765
  description {*
blanchet@62694
   766
    Corecursion Examples.
blanchet@62694
   767
  *}
blanchet@62694
   768
  theories
blanchet@62694
   769
    LFilter
blanchet@62734
   770
    Paper_Examples
blanchet@62694
   771
    Stream_Processor
blanchet@62696
   772
    "Tests/Simple_Nesting"
traytel@64379
   773
    "Tests/Iterate_GPV"
blanchet@62696
   774
  theories [quick_and_dirty]
blanchet@62696
   775
    "Tests/GPV_Bare_Bones"
blanchet@62696
   776
    "Tests/Merge_D"
blanchet@62696
   777
    "Tests/Merge_Poly"
blanchet@62696
   778
    "Tests/Misc_Mono"
blanchet@62696
   779
    "Tests/Misc_Poly"
blanchet@62696
   780
    "Tests/Small_Concrete"
blanchet@62725
   781
    "Tests/Stream_Friends"
blanchet@62696
   782
    "Tests/TLList_Friends"
blanchet@63190
   783
    "Tests/Type_Class"
blanchet@62694
   784
wenzelm@63888
   785
session "HOL-Word" (main timing) in Word = HOL +
wenzelm@65573
   786
  sessions
wenzelm@65573
   787
    "HOL-Library"
wenzelm@65382
   788
  theories
wenzelm@65462
   789
    Word
wenzelm@66445
   790
    WordBitwise
wenzelm@66443
   791
    Bit_Comparison
wenzelm@67122
   792
    WordExamples
wenzelm@56781
   793
  document_files "root.bib" "root.tex"
wenzelm@48481
   794
wenzelm@48738
   795
session "HOL-Statespace" in Statespace = HOL +
wenzelm@51558
   796
  theories [skip_proofs = false]
wenzelm@51558
   797
    StateSpaceEx
wenzelm@56781
   798
  document_files "root.tex"
wenzelm@48481
   799
wenzelm@65550
   800
session "HOL-Nonstandard_Analysis" (timing) in Nonstandard_Analysis = "HOL-Computational_Algebra" +
wenzelm@51421
   801
  description {*
wenzelm@51421
   802
    Nonstandard analysis.
wenzelm@51421
   803
  *}
wenzelm@62479
   804
  theories
wenzelm@62479
   805
    Nonstandard_Analysis
wenzelm@56781
   806
  document_files "root.tex"
wenzelm@48481
   807
wenzelm@63888
   808
session "HOL-Nonstandard_Analysis-Examples" (timing) in "Nonstandard_Analysis/Examples" = "HOL-Nonstandard_Analysis" +
wenzelm@65543
   809
  theories
wenzelm@65543
   810
    NSPrimes
wenzelm@48481
   811
wenzelm@48738
   812
session "HOL-Mirabelle" in Mirabelle = HOL +
wenzelm@48481
   813
  theories Mirabelle_Test
wenzelm@48589
   814
wenzelm@48738
   815
session "HOL-Mirabelle-ex" in "Mirabelle/ex" = "HOL-Mirabelle" +
wenzelm@66946
   816
  options [timeout = 60]
wenzelm@49448
   817
  theories Ex
wenzelm@48481
   818
wenzelm@63888
   819
session "HOL-Word-SMT_Examples" (timing) in SMT_Examples = "HOL-Word" +
wenzelm@66946
   820
  options [quick_and_dirty]
wenzelm@48481
   821
  theories
boehmes@52722
   822
    Boogie
wenzelm@48481
   823
    SMT_Examples
wenzelm@48481
   824
    SMT_Word_Examples
blanchet@50666
   825
    SMT_Tests
wenzelm@48481
   826
wenzelm@50844
   827
session "HOL-SPARK" (main) in "SPARK" = "HOL-Word" +
wenzelm@65382
   828
  theories
wenzelm@66992
   829
    SPARK
wenzelm@48481
   830
wenzelm@48738
   831
session "HOL-SPARK-Examples" in "SPARK/Examples" = "HOL-SPARK" +
wenzelm@66946
   832
  options [spark_prv = false]
wenzelm@48481
   833
  theories
wenzelm@48481
   834
    "Gcd/Greatest_Common_Divisor"
wenzelm@48481
   835
    "Liseq/Longest_Increasing_Subsequence"
wenzelm@48481
   836
    "RIPEMD-160/F"
wenzelm@48481
   837
    "RIPEMD-160/Hash"
wenzelm@48481
   838
    "RIPEMD-160/K_L"
wenzelm@48481
   839
    "RIPEMD-160/K_R"
wenzelm@48481
   840
    "RIPEMD-160/R_L"
wenzelm@48481
   841
    "RIPEMD-160/Round"
wenzelm@48481
   842
    "RIPEMD-160/R_R"
wenzelm@48481
   843
    "RIPEMD-160/S_L"
wenzelm@48481
   844
    "RIPEMD-160/S_R"
wenzelm@48481
   845
    "Sqrt/Sqrt"
wenzelm@48481
   846
wenzelm@65576
   847
session "HOL-SPARK-Manual" in "SPARK/Manual" = "HOL-SPARK" +
wenzelm@59810
   848
  options [show_question_marks = false, spark_prv = false]
wenzelm@66031
   849
  sessions
wenzelm@66031
   850
    "HOL-SPARK-Examples"
wenzelm@48481
   851
  theories
wenzelm@48481
   852
    Example_Verification
wenzelm@48481
   853
    VC_Principles
wenzelm@48481
   854
    Reference
wenzelm@48481
   855
    Complex_Types
wenzelm@56781
   856
  document_files
wenzelm@56781
   857
    "complex_types.ads"
wenzelm@56781
   858
    "complex_types_app.adb"
wenzelm@56781
   859
    "complex_types_app.ads"
wenzelm@56781
   860
    "Gcd.adb"
wenzelm@56781
   861
    "Gcd.ads"
wenzelm@56781
   862
    "intro.tex"
wenzelm@56781
   863
    "loop_invariant.adb"
wenzelm@56781
   864
    "loop_invariant.ads"
wenzelm@56781
   865
    "root.bib"
wenzelm@56781
   866
    "root.tex"
wenzelm@56781
   867
    "Simple_Gcd.adb"
wenzelm@56781
   868
    "Simple_Gcd.ads"
wenzelm@48481
   869
wenzelm@65573
   870
session "HOL-Mutabelle" in Mutabelle = "HOL-Library" +
wenzelm@48481
   871
  theories MutabelleExtra
wenzelm@48481
   872
wenzelm@65569
   873
session "HOL-Quickcheck_Examples" (timing) in Quickcheck_Examples = "HOL-Library" +
wenzelm@48588
   874
  theories
wenzelm@48690
   875
    Quickcheck_Examples
wenzelm@48690
   876
    Quickcheck_Lattice_Examples
wenzelm@48690
   877
    Completeness
wenzelm@48690
   878
    Quickcheck_Interfaces
blanchet@63731
   879
    Quickcheck_Nesting_Example
wenzelm@57584
   880
  theories [condition = ISABELLE_GHC]
Andreas@57544
   881
    Hotel_Example
wenzelm@48598
   882
    Quickcheck_Narrowing_Examples
wenzelm@48588
   883
wenzelm@65569
   884
session "HOL-Quotient_Examples" (timing) in Quotient_Examples = "HOL-Algebra" +
wenzelm@48481
   885
  description {*
wenzelm@48481
   886
    Author:     Cezary Kaliszyk and Christian Urban
wenzelm@48481
   887
  *}
wenzelm@48481
   888
  theories
wenzelm@48481
   889
    DList
kuncar@63920
   890
    Quotient_FSet
wenzelm@48481
   891
    Quotient_Int
wenzelm@48481
   892
    Quotient_Message
wenzelm@48481
   893
    Lift_FSet
wenzelm@48481
   894
    Lift_Set
wenzelm@48481
   895
    Lift_Fun
wenzelm@48481
   896
    Quotient_Rat
wenzelm@48481
   897
    Lift_DList
kuncar@53682
   898
    Int_Pow
kuncar@60237
   899
    Lifting_Code_Dt_Test
wenzelm@48481
   900
wenzelm@65569
   901
session "HOL-Predicate_Compile_Examples" (timing) in Predicate_Compile_Examples = "HOL-Library" +
wenzelm@62354
   902
  theories
wenzelm@48481
   903
    Examples
wenzelm@48481
   904
    Predicate_Compile_Tests
Andreas@61140
   905
    Predicate_Compile_Quickcheck_Examples
wenzelm@48481
   906
    Specialisation_Examples
wenzelm@55450
   907
    IMP_1
wenzelm@55450
   908
    IMP_2
wenzelm@48690
   909
    (* FIXME since 21-Jul-2011
Andreas@61140
   910
    Hotel_Example_Small_Generator *)
wenzelm@48690
   911
    IMP_3
Andreas@61140
   912
    IMP_4
wenzelm@62242
   913
  theories [condition = ISABELLE_SWIPL]
wenzelm@48690
   914
    Code_Prolog_Examples
wenzelm@48690
   915
    Context_Free_Grammar_Example
wenzelm@48690
   916
    Hotel_Example_Prolog
wenzelm@48690
   917
    Lambda_Example
wenzelm@48690
   918
    List_Examples
wenzelm@62242
   919
  theories [condition = ISABELLE_SWIPL, quick_and_dirty]
wenzelm@48690
   920
    Reg_Exp_Example
wenzelm@48481
   921
wenzelm@64551
   922
session "HOL-Types_To_Sets" in Types_To_Sets = HOL +
wenzelm@64551
   923
  description {*
wenzelm@64551
   924
    Experimental extension of Higher-Order Logic to allow translation of types to sets.
wenzelm@64551
   925
  *}
wenzelm@64551
   926
  theories
wenzelm@64551
   927
    Types_To_Sets
wenzelm@64551
   928
    "Examples/Prerequisites"
wenzelm@64551
   929
    "Examples/Finite"
wenzelm@64551
   930
    "Examples/T2_Spaces"
wenzelm@64551
   931
wenzelm@66982
   932
session HOLCF (main timing) in HOLCF = HOL +
wenzelm@48338
   933
  description {*
wenzelm@48338
   934
    Author:     Franz Regensburger
wenzelm@48338
   935
    Author:     Brian Huffman
wenzelm@48338
   936
wenzelm@48338
   937
    HOLCF -- a semantic extension of HOL by the LCF logic.
wenzelm@48338
   938
  *}
wenzelm@66982
   939
  sessions
wenzelm@66982
   940
    "HOL-Library"
wenzelm@48481
   941
  theories
wenzelm@65382
   942
    HOLCF (global)
wenzelm@56781
   943
  document_files "root.tex"
wenzelm@48338
   944
wenzelm@48738
   945
session "HOLCF-Tutorial" in "HOLCF/Tutorial" = HOLCF +
wenzelm@48481
   946
  theories
wenzelm@48481
   947
    Domain_ex
wenzelm@48481
   948
    Fixrec_ex
wenzelm@48481
   949
    New_Domain
wenzelm@56781
   950
  document_files "root.tex"
wenzelm@48481
   951
wenzelm@48738
   952
session "HOLCF-Library" in "HOLCF/Library" = HOLCF +
wenzelm@65570
   953
  theories
wenzelm@65570
   954
    HOLCF_Library
wenzelm@65570
   955
    HOL_Cpo
wenzelm@48481
   956
wenzelm@48738
   957
session "HOLCF-IMP" in "HOLCF/IMP" = HOLCF +
wenzelm@51403
   958
  description {*
wenzelm@51403
   959
    IMP -- A WHILE-language and its Semantics.
wenzelm@51403
   960
wenzelm@51403
   961
    This is the HOLCF-based denotational semantics of a simple WHILE-language.
wenzelm@51403
   962
  *}
wenzelm@65573
   963
  sessions
wenzelm@65573
   964
    "HOL-IMP"
wenzelm@65573
   965
  theories
wenzelm@65573
   966
    HoareEx
wenzelm@66950
   967
  document_files
wenzelm@66950
   968
    "isaverbatimwrite.sty"
wenzelm@66950
   969
    "root.tex"
wenzelm@66950
   970
    "root.bib"
wenzelm@48481
   971
wenzelm@65573
   972
session "HOLCF-ex" in "HOLCF/ex" = "HOLCF-Library" +
wenzelm@51421
   973
  description {*
wenzelm@51421
   974
    Miscellaneous examples for HOLCF.
wenzelm@51421
   975
  *}
wenzelm@48481
   976
  theories
wenzelm@48481
   977
    Dnat
wenzelm@48481
   978
    Dagstuhl
wenzelm@48481
   979
    Focus_ex
wenzelm@48481
   980
    Fix2
wenzelm@48481
   981
    Hoare
wenzelm@48481
   982
    Concurrency_Monad
wenzelm@48481
   983
    Loop
wenzelm@48481
   984
    Powerdomain_ex
wenzelm@48481
   985
    Domain_Proofs
wenzelm@48481
   986
    Letrec
wenzelm@48481
   987
    Pattern_Match
wenzelm@48481
   988
wenzelm@65573
   989
session "HOLCF-FOCUS" in "HOLCF/FOCUS" = "HOLCF-Library" +
wenzelm@51403
   990
  description {*
wenzelm@51403
   991
    FOCUS: a theory of stream-processing functions Isabelle/HOLCF.
wenzelm@51403
   992
wenzelm@51403
   993
    For introductions to FOCUS, see
wenzelm@51403
   994
wenzelm@51403
   995
    "The Design of Distributed Systems - An Introduction to FOCUS"
wenzelm@51403
   996
    http://www4.in.tum.de/publ/html.php?e=2
wenzelm@51403
   997
wenzelm@51403
   998
    "Specification and Refinement of a Buffer of Length One"
wenzelm@51403
   999
    http://www4.in.tum.de/publ/html.php?e=15
wenzelm@51403
  1000
wenzelm@51403
  1001
    "Specification and Development of Interactive Systems: Focus on Streams,
wenzelm@51403
  1002
    Interfaces, and Refinement" http://www4.in.tum.de/publ/html.php?e=321
wenzelm@51403
  1003
  *}
wenzelm@48481
  1004
  theories
wenzelm@48481
  1005
    Fstreams
wenzelm@48481
  1006
    FOCUS
wenzelm@48481
  1007
    Buffer_adm
wenzelm@48481
  1008
wenzelm@63888
  1009
session IOA (timing) in "HOLCF/IOA" = HOLCF +
wenzelm@48481
  1010
  description {*
wenzelm@48481
  1011
    Author:     Olaf Mueller
wenzelm@51403
  1012
    Copyright   1997 TU München
wenzelm@48481
  1013
wenzelm@51403
  1014
    A formalization of I/O automata in HOLCF.
wenzelm@51403
  1015
wenzelm@51403
  1016
    The distribution contains simulation relations, temporal logic, and an
wenzelm@51403
  1017
    abstraction theory. Everything is based upon a domain-theoretic model of
wenzelm@51403
  1018
    finite and infinite sequences.
wenzelm@48481
  1019
  *}
wenzelm@65538
  1020
  theories Abstraction
wenzelm@48481
  1021
wenzelm@48738
  1022
session "IOA-ABP" in "HOLCF/IOA/ABP" = IOA +
wenzelm@48481
  1023
  description {*
wenzelm@48481
  1024
    Author:     Olaf Mueller
wenzelm@48481
  1025
wenzelm@48481
  1026
    The Alternating Bit Protocol performed in I/O-Automata.
wenzelm@48481
  1027
  *}
wenzelm@59503
  1028
  theories
wenzelm@59503
  1029
    Correctness
wenzelm@59503
  1030
    Spec
wenzelm@48481
  1031
wenzelm@48738
  1032
session "IOA-NTP" in "HOLCF/IOA/NTP" = IOA +
wenzelm@48481
  1033
  description {*
wenzelm@48481
  1034
    Author:     Tobias Nipkow & Konrad Slind
wenzelm@48481
  1035
wenzelm@48481
  1036
    A network transmission protocol, performed in the
wenzelm@48481
  1037
    I/O automata formalization by Olaf Mueller.
wenzelm@48481
  1038
  *}
wenzelm@48481
  1039
  theories Correctness
wenzelm@48481
  1040
wenzelm@48738
  1041
session "IOA-Storage" in "HOLCF/IOA/Storage" = IOA +
wenzelm@48481
  1042
  description {*
wenzelm@48481
  1043
    Author:     Olaf Mueller
wenzelm@48481
  1044
wenzelm@48481
  1045
    Memory storage case study.
wenzelm@48481
  1046
  *}
wenzelm@48481
  1047
  theories Correctness
wenzelm@48481
  1048
wenzelm@48738
  1049
session "IOA-ex" in "HOLCF/IOA/ex" = IOA +
wenzelm@48481
  1050
  description {*
wenzelm@48481
  1051
    Author:     Olaf Mueller
wenzelm@48481
  1052
  *}
wenzelm@48481
  1053
  theories
wenzelm@48481
  1054
    TrivEx
wenzelm@48481
  1055
    TrivEx2