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