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