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