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