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