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