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