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