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