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