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