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