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