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