CONTRIBUTORS
author wenzelm
Tue Sep 29 21:36:33 2009 +0200 (2009-09-29)
changeset 32762 5f485f98652f
parent 32618 42865636d006
child 33005 bd8e15958708
permissions -rw-r--r--
Thomas Sewell, NICTA: more efficient HOL/record implementation;
     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 
     7 Contributions to this Isabelle version
     8 --------------------------------------
     9 
    10 * September 2009: Thomas Sewell, NICTA
    11   More efficient HOL/record implementation
    12 
    13 * September 2009: Sascha Boehme, TUM
    14   SMT method using external SMT solvers
    15 
    16 * September 2009: Florian Haftmann, TUM
    17   Refinement of Sets and Lattices
    18 
    19 * July 2009: Jeremy Avigad and Amine Chaieb
    20   New number theory
    21 
    22 * July 2009: Philipp Meyer, TUM
    23   HOL/Library/Sum_of_Squares: functionality to call a remote csdp prover
    24 
    25 * July 2009: Florian Haftmann, TUM
    26   New quickcheck implementation using new code generator
    27 
    28 * July 2009: Florian Haftmann, TUM
    29   HOL/Library/FSet: an explicit type of sets; finite sets ready to use for code generation
    30 
    31 * June 2009: Andreas Lochbihler, Uni Karlsruhe
    32   HOL/Library/Fin_Fun: almost everywhere constant functions
    33 
    34 * June 2009: Florian Haftmann, TUM
    35   HOL/Library/Tree: searchtrees implementing mappings, ready to use for code generation
    36 
    37 * March 2009: Philipp Meyer, TUM
    38   minimalization algorithm for results from sledgehammer call
    39 
    40 Contributions to Isabelle2009
    41 -----------------------------
    42 
    43 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
    44   Cambridge
    45   Elementary topology in Euclidean space.
    46 
    47 * March 2009: Johannes Hoelzl, TUM
    48   Method "approximation", which proves real valued inequalities by
    49   computation.
    50 
    51 * February 2009: Filip Maric, Univ. of Belgrade
    52   A Serbian theory.
    53 
    54 * February 2009: Jasmin Christian Blanchette, TUM
    55   Misc cleanup of HOL/refute.
    56 
    57 * February 2009: Timothy Bourke, NICTA
    58   New find_consts command.
    59 
    60 * February 2009: Timothy Bourke, NICTA
    61   "solves" criterion for find_theorems and auto_solve option
    62 
    63 * December 2008: Clemens Ballarin, TUM
    64   New locale implementation.
    65 
    66 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
    67   Method "sizechange" for advanced termination proofs.
    68 
    69 * November 2008: Timothy Bourke, NICTA
    70   Performance improvement (factor 50) for find_theorems.
    71 
    72 * 2008: Florian Haftmann, TUM
    73   Various extensions and restructurings in HOL, improvements
    74   in evaluation mechanisms, new module binding.ML for name bindings.
    75 
    76 * October 2008: Fabian Immler, TUM
    77   ATP manager for Sledgehammer, based on ML threads instead of Posix
    78   processes.  Additional ATP wrappers, including remote SystemOnTPTP
    79   services.
    80 
    81 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
    82   Prover for coherent logic.
    83 
    84 * August 2008: Fabian Immler, TUM
    85   Vampire wrapper script for remote SystemOnTPTP service.
    86 
    87 
    88 Contributions to Isabelle2008
    89 -----------------------------
    90 
    91 * 2007/2008:
    92   Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
    93   HOL library improvements.
    94 
    95 * 2007/2008: Brian Huffman, PSU
    96   HOLCF library improvements.
    97 
    98 * 2007/2008: Stefan Berghofer, TUM
    99   HOL-Nominal package improvements.
   100 
   101 * March 2008: Markus Reiter, TUM
   102   HOL/Library/RBT: red-black trees.
   103 
   104 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
   105   Lukas Bulwahn, TUM and John Matthews, Galois:
   106   HOL/Library/Imperative_HOL: Haskell-style imperative data structures
   107   for HOL.
   108 
   109 * December 2007: Norbert Schirmer, Uni Saarbruecken
   110   Misc improvements of record package in HOL.
   111 
   112 * December 2007: Florian Haftmann, TUM
   113   Overloading and class instantiation target.
   114 
   115 * December 2007: Florian Haftmann, TUM
   116   New version of primrec package for local theories.
   117 
   118 * December 2007: Alexander Krauss, TUM
   119   Method "induction_scheme" in HOL.
   120 
   121 * November 2007: Peter Lammich, Uni Muenster
   122   HOL-Lattice: some more lemmas.
   123 
   124 
   125 Contributions to Isabelle2007
   126 -----------------------------
   127 
   128 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
   129   State Spaces: The Locale Way (in HOL).
   130 
   131 * October 2007: Mark A. Hillebrand, DFKI
   132   Robust sub/superscripts in LaTeX document output.
   133 
   134 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
   135     Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
   136   HOL-Word: a library for fixed-size machine words in Isabelle.
   137 
   138 * August 2007: Brian Huffman, PSU
   139   HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
   140 
   141 * June 2007: Amine Chaieb, TUM
   142   Semiring normalization and Groebner Bases.
   143   Support for dense linear orders.
   144 
   145 * June 2007: Joe Hurd, Oxford
   146   Metis theorem-prover.
   147 
   148 * 2007: Kong W. Susanto, Cambridge
   149   HOL: Metis prover integration.
   150 
   151 * 2007: Stefan Berghofer, TUM
   152   HOL: inductive predicates and sets.
   153 
   154 * 2007: Norbert Schirmer, TUM
   155   HOL/record: misc improvements.
   156 
   157 * 2006/2007: Alexander Krauss, TUM
   158   HOL: function package and related theories on termination.
   159 
   160 * 2006/2007: Florian Haftmann, TUM
   161   Pure: generic code generator framework.
   162   Pure: class package.
   163   HOL: theory reorganization, code generator setup.
   164 
   165 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
   166     Julien Narboux, TUM
   167   HOL/Nominal package and related tools.
   168 
   169 * November 2006: Lukas Bulwahn, TUM
   170   HOL: method "lexicographic_order" for function package.
   171 
   172 * October 2006: Stefan Hohe, TUM
   173   HOL-Algebra: ideals and quotients over rings.
   174 
   175 * August 2006: Amine Chaieb, TUM
   176   Experimental support for generic reflection and reification in HOL.
   177 
   178 * July 2006: Rafal Kolanski, NICTA
   179   Hex (0xFF) and binary (0b1011) numerals.
   180 
   181 * May 2006: Klaus Aehlig, LMU
   182   Command 'normal_form': normalization by evaluation.
   183 
   184 * May 2006: Amine Chaieb, TUM
   185   HOL-Complex: Ferrante and Rackoff Algorithm for linear real
   186   arithmetic.
   187 
   188 * February 2006: Benjamin Porter, NICTA
   189   HOL and HOL-Complex: generalised mean value theorem, continuum is
   190   not denumerable, harmonic and arithmetic series, and denumerability
   191   of rationals.
   192 
   193 * October 2005: Martin Wildmoser, TUM
   194   Sketch for Isar 'guess' element.
   195 
   196 
   197 Contributions to Isabelle2005
   198 -----------------------------
   199 
   200 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
   201   HOL-Complex: Formalization of Taylor series.
   202 
   203 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
   204   Components for SAT solver method using zChaff.
   205 
   206 * September 2005: Ning Zhang and Christian Urban, LMU Munich
   207   A Chinese theory.
   208 
   209 * September 2005: Bernhard Haeupler, TUM
   210   Method comm_ring for proving equalities in commutative rings.
   211 
   212 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
   213   Various improvements of the HOL and HOL-Complex library.
   214 
   215 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
   216   Some structured proofs about completeness of real numbers.
   217 
   218 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
   219   Improved retrieval of facts from theory/proof context.
   220 
   221 * February 2005: Lucas Dixon, University of Edinburgh
   222   Improved subst method.
   223 
   224 * 2005: Brian Huffman, OGI
   225   Various improvements of HOLCF.
   226   Some improvements of the HOL-Complex library.
   227 
   228 * 2005: Claire Quigley and Jia Meng, University of Cambridge
   229   Some support for asynchronous communication with external provers
   230   (experimental).
   231 
   232 * 2005: Florian Haftmann, TUM
   233   Contributions to document 'sugar'.
   234   Various ML combinators, notably linear functional transformations.
   235   Some cleanup of ML legacy.
   236   Additional antiquotations.
   237   Improved Isabelle web site.
   238 
   239 * 2004/2005: David Aspinall, University of Edinburgh
   240   Various elements of XML and PGIP based communication with user
   241   interfaces (experimental).
   242 
   243 * 2004/2005: Gerwin Klein, NICTA
   244   Contributions to document 'sugar'.
   245   Improved Isabelle web site.
   246   Improved HTML presentation of theories.
   247 
   248 * 2004/2005: Clemens Ballarin, TUM
   249   Provers: tools for transitive relations and quasi orders.
   250   Improved version of locales, notably interpretation of locales.
   251   Improved version of HOL-Algebra.
   252 
   253 * 2004/2005: Amine Chaieb, TUM
   254   Improved version of HOL presburger method.
   255 
   256 * 2004/2005: Steven Obua, TUM
   257   Improved version of HOL/Import, support for HOL-Light.
   258   Improved version of HOL-Complex-Matrix.
   259   Pure/defs: more sophisticated checks on well-formedness of overloading.
   260   Pure/Tools: an experimental evaluator for lambda terms.
   261 
   262 * 2004/2005: Norbert Schirmer, TUM
   263   Contributions to document 'sugar'.
   264   Improved version of HOL/record.
   265 
   266 * 2004/2005: Sebastian Skalberg, TUM
   267   Improved version of HOL/Import.
   268   Some internal ML reorganizations.
   269 
   270 * 2004/2005: Tjark Weber, TUM
   271   SAT solver method using zChaff.
   272   Improved version of HOL/refute.