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