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