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