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