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