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