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