CONTRIBUTORS
author kleing
Mon Aug 20 04:34:31 2007 +0200 (2007-08-20)
changeset 24333 e77ea0ea7f2c
parent 24332 e3a2b75b1cf9
child 24799 dff164b6f2a6
permissions -rw-r--r--
* HOL-Word:
New extensive library and type for generic, fixed size machine
words, with arithemtic, bit-wise, shifting and rotating operations,
reflection into int, nat, and bool lists, automation for linear
arithmetic (by automatic reflection into nat or int), including
lemmas on overflow and monotonicity. Instantiated to all appropriate
arithmetic type classes, supporting automatic simplification of
numerals on all operations. Jointly developed by NICTA, Galois, and
PSU.

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