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