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