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