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