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