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