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