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