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