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