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