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