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