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