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