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