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