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