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