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