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