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