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