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