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