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