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