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