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