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