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