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