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