CONTRIBUTORS
author hoelzl
Thu Jun 12 15:47:36 2014 +0200 (2014-06-12)
changeset 57235 b0b9a10e4bf4
parent 57216 6cd8566e938e
child 57252 19b7ace1c5da
permissions -rw-r--r--
properties of Erlang and exponentially distributed random variables (by Sudeep Kanav)
     1 For the purposes of the license agreement in the file COPYRIGHT, a
     2 'contributor' is anybody who is listed in this file (CONTRIBUTORS) or
     3 who is listed as an author in one of the source files of this Isabelle
     4 distribution.
     5 
     6 Contributions to this Isabelle version
     7 --------------------------------------
     8 
     9 
    10 * Summer 2014: Mathias Fleury, ENS Rennes, and Albert Steckermeier, TUM
    11   Work on exotic automatic theorem provers for Sledgehammer (LEO-II, veriT,
    12   Waldmeister, etc.).
    13 
    14 * June 2014: Sudeep Kanav, TUM, and Johannes Hölzl, TUM
    15   Various properties of Erlang and exponentially distributed random variables.
    16 
    17 * May 2014: Cezary Kaliszyk, University of Innsbruck, and Jasmin Blanchette, TUM
    18   SML-based engines for MaSh.
    19 
    20 * March 2014: René Thiemann
    21   Improved code generation for multisets.
    22 
    23 * February 2014: Florian Haftmann, TUM
    24   Permanent interpretation inside theory, locale and class targets with mixin definitions.
    25 
    26 * Fall 2013 and Winter 2014: Martin Desharnais, Lorenz Panny, Dmitriy Traytel,
    27   and Jasmin Blanchette, TUM
    28   Various improvements to the BNF-based (co)datatype package, including
    29   a more polished "primcorec" command, optimizations, and integration in
    30   the "HOL" session.
    31 
    32 * Winter/Spring 2014: Sascha Boehme, QAware GmbH, and Jasmin Blanchette, TUM
    33   "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and Z3 4.3.
    34 
    35 * January 2014: Lars Hupel, TUM
    36   An improved, interactive simplifier trace with integration into the
    37   Isabelle/jEdit Prover IDE.
    38 
    39 * December 2013: Florian Haftmann, TUM
    40   Consolidation of abstract interpretations concerning min and max.
    41 
    42 * November 2013: Florian Haftmann, TUM
    43   Abolition of negative numeral literals in the logic.
    44 
    45 
    46 Contributions to Isabelle2013-1
    47 -------------------------------
    48 
    49 * September 2013: Lars Noschinski, TUM
    50   Conversion between function definitions as list of equations and
    51   case expressions in HOL.
    52   New library Simps_Case_Conv with commands case_of_simps,
    53   simps_of_case.
    54 
    55 * September 2013: Nik Sultana, University of Cambridge
    56   Improvements to HOL/TPTP parser and import facilities.
    57 
    58 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
    59   New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
    60 
    61 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
    62   Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
    63 
    64 * Summer 2013: Manuel Eberl, TUM
    65   Generation of elimination rules in the function package.
    66   New command "fun_cases".
    67 
    68 * Summer 2013: Christian Sternagel, JAIST
    69   Improved support for ad hoc overloading of constants, including
    70   documentation and examples.
    71 
    72 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
    73   Jasmin Blanchette, TUM
    74   Various improvements to the BNF-based (co)datatype package, including
    75   "primrec_new" and "primcorec" commands and a compatibility layer.
    76 
    77 * Spring and Summer 2013: Ondrej Kuncar, TUM
    78   Various improvements of Lifting and Transfer packages.
    79 
    80 * Spring 2013: Brian Huffman, Galois Inc.
    81   Improvements of the Transfer package.
    82 
    83 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
    84   Jasmin Blanchette, TUM
    85   Various improvements to MaSh, including a server mode.
    86 
    87 * First half of 2013: Steffen Smolka, TUM
    88   Further improvements to Sledgehammer's Isar proof generator.
    89 
    90 * May 2013: Florian Haftmann, TUM
    91   Ephemeral interpretation in local theories.
    92 
    93 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
    94   Spec_Check: A Quickcheck tool for Isabelle/ML.
    95 
    96 * April 2013: Stefan Berghofer, secunet Security Networks AG
    97   Dmitriy Traytel, TUM
    98   Makarius Wenzel, Université Paris-Sud / LRI
    99   Case translations as a separate check phase independent of the
   100   datatype package.
   101 
   102 * March 2013: Florian Haftmann, TUM
   103   Reform of "big operators" on sets.
   104 
   105 * March 2013: Florian Haftmann, TUM
   106   Algebraic locale hierarchy for orderings and (semi)lattices.
   107 
   108 * February 2013: Florian Haftmann, TUM
   109   Reworking and consolidation of code generation for target language
   110   numerals.
   111 
   112 * February 2013: Florian Haftmann, TUM
   113   Sieve of Eratosthenes.
   114 
   115 
   116 Contributions to Isabelle2013
   117 -----------------------------
   118 
   119 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
   120   Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
   121 
   122 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
   123   Jasmin Blanchette, TUM
   124   Implemented Machine Learning for Sledgehammer (MaSh).
   125 
   126 * Fall 2012: Steffen Smolka, TUM
   127   Various improvements to Sledgehammer's Isar proof generator,
   128   including a smart type annotation algorithm and proof shrinking.
   129 
   130 * December 2012: Alessandro Coglio, Kestrel
   131   Contributions to HOL's Lattice library.
   132 
   133 * November 2012: Fabian Immler, TUM
   134   "Symbols" dockable for Isabelle/jEdit.
   135 
   136 * November 2012: Fabian Immler, TUM
   137   Proof of the Daniell-Kolmogorov theorem: the existence of the limit
   138   of projective families.
   139 
   140 * October 2012: Andreas Lochbihler, KIT
   141   Efficient construction of red-black trees from sorted associative
   142   lists.
   143 
   144 * September 2012: Florian Haftmann, TUM
   145   Lattice instances for type option.
   146 
   147 * September 2012: Christian Sternagel, JAIST
   148   Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
   149   Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
   150 
   151 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
   152   New BNF-based (co)datatype package.
   153 
   154 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
   155   Theories of ordinals and cardinals.
   156 
   157 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
   158   Advanced support for Isabelle sessions and build management, notably
   159   "isabelle build".
   160 
   161 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
   162   Simproc for rewriting set comprehensions into pointfree expressions.
   163 
   164 * May 2012: Andreas Lochbihler, KIT
   165   Theory of almost everywhere constant functions.
   166 
   167 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
   168   Graphview in Scala/Swing.
   169 
   170 
   171 Contributions to Isabelle2012
   172 -----------------------------
   173 
   174 * April 2012: Johannes Hölzl, TUM
   175   Probability: Introduced type to represent measures instead of
   176   locales.
   177 
   178 * April 2012: Johannes Hölzl, Fabian Immler, TUM
   179   Float: Moved to Dyadic rationals to represent floating point numers.
   180 
   181 * April 2012: Thomas Sewell, NICTA and
   182   2010: Sascha Boehme, TUM
   183   Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
   184   equalities/inequalities.
   185 
   186 * March 2012: Christian Sternagel, JAIST
   187   Consolidated theory of relation composition.
   188 
   189 * March 2012: Nik Sultana, University of Cambridge
   190   HOL/TPTP parser and import facilities.
   191 
   192 * March 2012: Cezary Kaliszyk, University of Innsbruck and
   193   Alexander Krauss, QAware GmbH
   194   Faster and more scalable Import mechanism for HOL Light proofs.
   195 
   196 * January 2012: Florian Haftmann, TUM, et al.
   197   (Re-)Introduction of the "set" type constructor.
   198 
   199 * 2012: Ondrej Kuncar, TUM
   200   New package Lifting, various improvements and refinements to the
   201   Quotient package.
   202 
   203 * 2011/2012: Jasmin Blanchette, TUM
   204   Various improvements to Sledgehammer, notably: tighter integration
   205   with SPASS, support for more provers (Alt-Ergo, iProver,
   206   iProver-Eq).
   207 
   208 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
   209   Various refinements of local theory infrastructure.
   210   Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
   211 
   212 
   213 Contributions to Isabelle2011-1
   214 -------------------------------
   215 
   216 * September 2011: Peter Gammie
   217   Theory HOL/Library/Saturated: numbers with saturated arithmetic.
   218 
   219 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
   220   Refined theory on complete lattices.
   221 
   222 * August 2011: Brian Huffman, Portland State University
   223   Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
   224 
   225 * June 2011: Brian Huffman, Portland State University
   226   Proof method "countable_datatype" for theory Library/Countable.
   227 
   228 * 2011: Jasmin Blanchette, TUM
   229   Various improvements to Sledgehammer, notably: use of sound
   230   translations, support for more provers (Waldmeister, LEO-II,
   231   Satallax). Further development of Nitpick and 'try' command.
   232 
   233 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
   234   Theory HOL/Library/Cset_Monad allows do notation for computable sets
   235   (cset) via the generic monad ad-hoc overloading facility.
   236 
   237 * 2011: Johannes Hölzl, Armin Heller, TUM and
   238   Bogdan Grechuk, University of Edinburgh
   239   Theory HOL/Library/Extended_Reals: real numbers extended with plus
   240   and minus infinity.
   241 
   242 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
   243   Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
   244   Prover IDE.
   245 
   246 
   247 Contributions to Isabelle2011
   248 -----------------------------
   249 
   250 * January 2011: Stefan Berghofer, secunet Security Networks AG
   251   HOL-SPARK: an interactive prover back-end for SPARK.
   252 
   253 * October 2010: Bogdan Grechuk, University of Edinburgh
   254   Extended convex analysis in Multivariate Analysis.
   255 
   256 * October 2010: Dmitriy Traytel, TUM
   257   Coercive subtyping via subtype constraints.
   258 
   259 * October 2010: Alexander Krauss, TUM
   260   Command partial_function for function definitions based on complete
   261   partial orders in HOL.
   262 
   263 * September 2010: Florian Haftmann, TUM
   264   Refined concepts for evaluation, i.e., normalization of terms using
   265   different techniques.
   266 
   267 * September 2010: Florian Haftmann, TUM
   268   Code generation for Scala.
   269 
   270 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
   271   Improved Probability theory in HOL.
   272 
   273 * July 2010: Florian Haftmann, TUM
   274   Reworking and extension of the Imperative HOL framework.
   275 
   276 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
   277     of Innsbruck
   278   Ad-hoc overloading. Generic do notation for monads.
   279 
   280 
   281 Contributions to Isabelle2009-2
   282 -------------------------------
   283 
   284 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
   285   Makarius Wenzel, TUM / LRI
   286   Elimination of type classes from proof terms.
   287 
   288 * April 2010: Florian Haftmann, TUM
   289   Reorganization of abstract algebra type classes.
   290 
   291 * April 2010: Florian Haftmann, TUM
   292   Code generation for data representations involving invariants;
   293   various collections avaiable in theories Fset, Dlist, RBT,
   294   Mapping and AssocList.
   295 
   296 * March 2010: Sascha Boehme, TUM
   297   Efficient SHA1 library for Poly/ML.
   298 
   299 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
   300   Quotient type package for Isabelle/HOL.
   301 
   302 
   303 Contributions to Isabelle2009-1
   304 -------------------------------
   305 
   306 * November 2009, Brian Huffman, PSU
   307   New definitional domain package for HOLCF.
   308 
   309 * November 2009: Robert Himmelmann, TUM
   310   Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
   311 
   312 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
   313   A tabled implementation of the reflexive transitive closure.
   314 
   315 * November 2009: Lukas Bulwahn, TUM
   316   Predicate Compiler: a compiler for inductive predicates to
   317   equational specifications.
   318 
   319 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
   320   HOL-Boogie: an interactive prover back-end for Boogie and VCC.
   321 
   322 * October 2009: Jasmin Blanchette, TUM
   323   Nitpick: yet another counterexample generator for Isabelle/HOL.
   324 
   325 * October 2009: Sascha Boehme, TUM
   326   Extension of SMT method: proof-reconstruction for the SMT solver Z3.
   327 
   328 * October 2009: Florian Haftmann, TUM
   329   Refinement of parts of the HOL datatype package.
   330 
   331 * October 2009: Florian Haftmann, TUM
   332   Generic term styles for term antiquotations.
   333 
   334 * September 2009: Thomas Sewell, NICTA
   335   More efficient HOL/record implementation.
   336 
   337 * September 2009: Sascha Boehme, TUM
   338   SMT method using external SMT solvers.
   339 
   340 * September 2009: Florian Haftmann, TUM
   341   Refinement of sets and lattices.
   342 
   343 * July 2009: Jeremy Avigad and Amine Chaieb
   344   New number theory.
   345 
   346 * July 2009: Philipp Meyer, TUM
   347   HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
   348   prover.
   349 
   350 * July 2009: Florian Haftmann, TUM
   351   New quickcheck implementation using new code generator.
   352 
   353 * July 2009: Florian Haftmann, TUM
   354   HOL/Library/Fset: an explicit type of sets; finite sets ready to use
   355   for code generation.
   356 
   357 * June 2009: Florian Haftmann, TUM
   358   HOL/Library/Tree: search trees implementing mappings, ready to use
   359   for code generation.
   360 
   361 * March 2009: Philipp Meyer, TUM
   362   Minimization tool for results from Sledgehammer.
   363 
   364 
   365 Contributions to Isabelle2009
   366 -----------------------------
   367 
   368 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
   369   Cambridge
   370   Elementary topology in Euclidean space.
   371 
   372 * March 2009: Johannes Hoelzl, TUM
   373   Method "approximation", which proves real valued inequalities by
   374   computation.
   375 
   376 * February 2009: Filip Maric, Univ. of Belgrade
   377   A Serbian theory.
   378 
   379 * February 2009: Jasmin Christian Blanchette, TUM
   380   Misc cleanup of HOL/refute.
   381 
   382 * February 2009: Timothy Bourke, NICTA
   383   New find_consts command.
   384 
   385 * February 2009: Timothy Bourke, NICTA
   386   "solves" criterion for find_theorems and auto_solve option
   387 
   388 * December 2008: Clemens Ballarin, TUM
   389   New locale implementation.
   390 
   391 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
   392   Method "sizechange" for advanced termination proofs.
   393 
   394 * November 2008: Timothy Bourke, NICTA
   395   Performance improvement (factor 50) for find_theorems.
   396 
   397 * 2008: Florian Haftmann, TUM
   398   Various extensions and restructurings in HOL, improvements
   399   in evaluation mechanisms, new module binding.ML for name bindings.
   400 
   401 * October 2008: Fabian Immler, TUM
   402   ATP manager for Sledgehammer, based on ML threads instead of Posix
   403   processes.  Additional ATP wrappers, including remote SystemOnTPTP
   404   services.
   405 
   406 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
   407   Prover for coherent logic.
   408 
   409 * August 2008: Fabian Immler, TUM
   410   Vampire wrapper script for remote SystemOnTPTP service.
   411 
   412 
   413 Contributions to Isabelle2008
   414 -----------------------------
   415 
   416 * 2007/2008:
   417   Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
   418   HOL library improvements.
   419 
   420 * 2007/2008: Brian Huffman, PSU
   421   HOLCF library improvements.
   422 
   423 * 2007/2008: Stefan Berghofer, TUM
   424   HOL-Nominal package improvements.
   425 
   426 * March 2008: Markus Reiter, TUM
   427   HOL/Library/RBT: red-black trees.
   428 
   429 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
   430   Lukas Bulwahn, TUM and John Matthews, Galois:
   431   HOL/Library/Imperative_HOL: Haskell-style imperative data structures
   432   for HOL.
   433 
   434 * December 2007: Norbert Schirmer, Uni Saarbruecken
   435   Misc improvements of record package in HOL.
   436 
   437 * December 2007: Florian Haftmann, TUM
   438   Overloading and class instantiation target.
   439 
   440 * December 2007: Florian Haftmann, TUM
   441   New version of primrec package for local theories.
   442 
   443 * December 2007: Alexander Krauss, TUM
   444   Method "induction_scheme" in HOL.
   445 
   446 * November 2007: Peter Lammich, Uni Muenster
   447   HOL-Lattice: some more lemmas.
   448 
   449 
   450 Contributions to Isabelle2007
   451 -----------------------------
   452 
   453 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
   454   State Spaces: The Locale Way (in HOL).
   455 
   456 * October 2007: Mark A. Hillebrand, DFKI
   457   Robust sub/superscripts in LaTeX document output.
   458 
   459 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
   460     Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
   461   HOL-Word: a library for fixed-size machine words in Isabelle.
   462 
   463 * August 2007: Brian Huffman, PSU
   464   HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
   465 
   466 * June 2007: Amine Chaieb, TUM
   467   Semiring normalization and Groebner Bases.
   468   Support for dense linear orders.
   469 
   470 * June 2007: Joe Hurd, Oxford
   471   Metis theorem-prover.
   472 
   473 * 2007: Kong W. Susanto, Cambridge
   474   HOL: Metis prover integration.
   475 
   476 * 2007: Stefan Berghofer, TUM
   477   HOL: inductive predicates and sets.
   478 
   479 * 2007: Norbert Schirmer, TUM
   480   HOL/record: misc improvements.
   481 
   482 * 2006/2007: Alexander Krauss, TUM
   483   HOL: function package and related theories on termination.
   484 
   485 * 2006/2007: Florian Haftmann, TUM
   486   Pure: generic code generator framework.
   487   Pure: class package.
   488   HOL: theory reorganization, code generator setup.
   489 
   490 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
   491     Julien Narboux, TUM
   492   HOL/Nominal package and related tools.
   493 
   494 * November 2006: Lukas Bulwahn, TUM
   495   HOL: method "lexicographic_order" for function package.
   496 
   497 * October 2006: Stefan Hohe, TUM
   498   HOL-Algebra: ideals and quotients over rings.
   499 
   500 * August 2006: Amine Chaieb, TUM
   501   Experimental support for generic reflection and reification in HOL.
   502 
   503 * July 2006: Rafal Kolanski, NICTA
   504   Hex (0xFF) and binary (0b1011) numerals.
   505 
   506 * May 2006: Klaus Aehlig, LMU
   507   Command 'normal_form': normalization by evaluation.
   508 
   509 * May 2006: Amine Chaieb, TUM
   510   HOL-Complex: Ferrante and Rackoff Algorithm for linear real
   511   arithmetic.
   512 
   513 * February 2006: Benjamin Porter, NICTA
   514   HOL and HOL-Complex: generalised mean value theorem, continuum is
   515   not denumerable, harmonic and arithmetic series, and denumerability
   516   of rationals.
   517 
   518 * October 2005: Martin Wildmoser, TUM
   519   Sketch for Isar 'guess' element.
   520 
   521 
   522 Contributions to Isabelle2005
   523 -----------------------------
   524 
   525 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
   526   HOL-Complex: Formalization of Taylor series.
   527 
   528 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
   529   Components for SAT solver method using zChaff.
   530 
   531 * September 2005: Ning Zhang and Christian Urban, LMU Munich
   532   A Chinese theory.
   533 
   534 * September 2005: Bernhard Haeupler, TUM
   535   Method comm_ring for proving equalities in commutative rings.
   536 
   537 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
   538   Various improvements of the HOL and HOL-Complex library.
   539 
   540 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
   541   Some structured proofs about completeness of real numbers.
   542 
   543 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
   544   Improved retrieval of facts from theory/proof context.
   545 
   546 * February 2005: Lucas Dixon, University of Edinburgh
   547   Improved subst method.
   548 
   549 * 2005: Brian Huffman, OGI
   550   Various improvements of HOLCF.
   551   Some improvements of the HOL-Complex library.
   552 
   553 * 2005: Claire Quigley and Jia Meng, University of Cambridge
   554   Some support for asynchronous communication with external provers
   555   (experimental).
   556 
   557 * 2005: Florian Haftmann, TUM
   558   Contributions to document 'sugar'.
   559   Various ML combinators, notably linear functional transformations.
   560   Some cleanup of ML legacy.
   561   Additional antiquotations.
   562   Improved Isabelle web site.
   563 
   564 * 2004/2005: David Aspinall, University of Edinburgh
   565   Various elements of XML and PGIP based communication with user
   566   interfaces (experimental).
   567 
   568 * 2004/2005: Gerwin Klein, NICTA
   569   Contributions to document 'sugar'.
   570   Improved Isabelle web site.
   571   Improved HTML presentation of theories.
   572 
   573 * 2004/2005: Clemens Ballarin, TUM
   574   Provers: tools for transitive relations and quasi orders.
   575   Improved version of locales, notably interpretation of locales.
   576   Improved version of HOL-Algebra.
   577 
   578 * 2004/2005: Amine Chaieb, TUM
   579   Improved version of HOL presburger method.
   580 
   581 * 2004/2005: Steven Obua, TUM
   582   Improved version of HOL/Import, support for HOL-Light.
   583   Improved version of HOL-Complex-Matrix.
   584   Pure/defs: more sophisticated checks on well-formedness of overloading.
   585   Pure/Tools: an experimental evaluator for lambda terms.
   586 
   587 * 2004/2005: Norbert Schirmer, TUM
   588   Contributions to document 'sugar'.
   589   Improved version of HOL/record.
   590 
   591 * 2004/2005: Sebastian Skalberg, TUM
   592   Improved version of HOL/Import.
   593   Some internal ML reorganizations.
   594 
   595 * 2004/2005: Tjark Weber, TUM
   596   SAT solver method using zChaff.
   597   Improved version of HOL/refute.