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