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