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