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