CONTRIBUTORS
author kleing
Thu Jun 14 09:54:14 2007 +0200 (2007-06-14)
changeset 23382 0459ab90389a
parent 23252 67268bb40b21
child 23449 dd874e6a3282
permissions -rw-r--r--
clarified who we consider to be a contributor
     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 Isabelle 2007
     8 ------------------------------
     9 
    10 * June 2007: Amine Chaieb, TUM
    11   Semiring normalization and Groebner Bases
    12 
    13 * 2006/2007: Florian Haftmann, TUM
    14   Pure: generic code generator framework.
    15   Pure: class package.
    16   HOL: theory tuning, code generator setup.
    17 
    18 * November 2006: Lukas Bulwahn, TUM
    19   HOL/function: method "lexicographic_order".
    20 
    21 * October 2006: Stefan Hohe, TUM
    22   HOL-Algebra: ideals and quotients over rings.
    23 
    24 * August 2006: Amine Chaieb, TUM
    25   Experimental support for generic reflection and reification in HOL.
    26 
    27 * July 2006: Rafal Kolanski, NICTA
    28   Hex (0xFF) and binary (0b1011) numerals.
    29 
    30 * May 2006: Klaus Aehlig, LMU
    31   Command 'normal_form': normalization by evaluation.
    32 
    33 * May 2006: Amine Chaieb, TUM
    34   HOL-Complex: Ferrante and Rackoff Algorithm for linear real
    35   arithmetic.
    36 
    37 * February 2006: Benjamin Porter, NICTA
    38   HOL and HOL-Complex: generalised mean value theorem, continuum is
    39   not denumerable, harmonic and arithmetic series, and denumerability
    40   of rationals.
    41 
    42 * October 2005: Martin Wildmoser, TUM
    43   Sketch for Isar 'guess' element.
    44 
    45 
    46 Contributions to Isabelle 2005
    47 ------------------------------
    48 
    49 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
    50   HOL-Complex: Formalization of Taylor series.
    51 
    52 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
    53   Components for SAT solver method using zChaff.
    54 
    55 * September 2005: Ning Zhang and Christian Urban, LMU Munich
    56   A Chinese theory.
    57 
    58 * September 2005: Bernhard Haeupler, TUM
    59   Method comm_ring for proving equalities in commutative rings.
    60 
    61 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
    62   Various improvements of the HOL and HOL-Complex library.
    63 
    64 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
    65   Some structured proofs about completeness of real numbers.
    66 
    67 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
    68   Improved retrieval of facts from theory/proof context.
    69 
    70 * February 2005: Lucas Dixon, University of Edinburgh
    71   Improved subst method.
    72 
    73 * 2005: Brian Huffman, OGI
    74   Various improvements of HOLCF.
    75   Some improvements of the HOL-Complex library.
    76 
    77 * 2005: Claire Quigley and Jia Meng, University of Cambridge
    78   Some support for asynchronous communication with external provers
    79   (experimental).
    80 
    81 * 2005: Florian Haftmann, TUM
    82   Contributions to document 'sugar'.
    83   Various ML combinators, notably linear functional transformations.
    84   Some cleanup of ML legacy.
    85   Additional antiquotations.
    86   Improved Isabelle web site.
    87 
    88 * 2004/2005: David Aspinall, University of Edinburgh
    89   Various elements of XML and PGIP based communication with user
    90   interfaces (experimental).
    91 
    92 * 2004/2005: Gerwin Klein, NICTA
    93   Contributions to document 'sugar'.
    94   Improved Isabelle web site.
    95   Improved HTML presentation of theories.
    96 
    97 * 2004/2005: Clemens Ballarin, TUM
    98   Provers: tools for transitive relations and quasi orders.
    99   Improved version of locales, notably interpretation of locales.
   100   Improved version of HOL-Algebra.
   101 
   102 * 2004/2005: Amine Chaieb, TUM
   103   Improved version of HOL presburger method.
   104 
   105 * 2004/2005: Steven Obua, TUM
   106   Improved version of HOL/Import, support for HOL-Light.
   107   Improved version of HOL-Complex-Matrix.
   108   Pure/defs: more sophisticated checks on well-formedness of overloading.
   109   Pure/Tools: an experimental evaluator for lambda terms.
   110 
   111 * 2004/2005: Norbert Schirmer, TUM
   112   Contributions to document 'sugar'.
   113   Improved version of HOL/record.
   114 
   115 * 2004/2005: Sebastian Skalberg, TUM
   116   Improved version of HOL/Import.
   117   Some internal ML reorganizations.
   118 
   119 * 2004/2005: Tjark Weber, TUM
   120   SAT solver method using zChaff.
   121   Improved version of HOL/refute.
   122 
   123 $Id$