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