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