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