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