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