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