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