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