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