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