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