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