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