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