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