CONTRIBUTORS
author wenzelm
Fri Feb 27 20:00:54 2009 +0100 (2009-02-27)
changeset 30154 9193a48d3f95
parent 29883 14841d4c808e
child 30162 097673d2e50f
permissions -rw-r--r--
more CONTRIBUTORS;
     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 this Isabelle version
     8 --------------------------------------
     9 
    10 * February 2008: Jasmin Christian Blanchette, TUM
    11   Misc cleanup of HOL/refute.
    12 
    13 * February 2008: Timothy Bourke, NICTA
    14   New find_consts command.
    15 
    16 * February 2008: Timothy Bourke, NICTA
    17   "solves" criterion for find_theorems and auto_solve option
    18 
    19 * December 2008: Clemens Ballarin, TUM
    20   New locale implementation.
    21 
    22 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
    23   Method "sizechange" for advanced termination proofs.
    24 
    25 * November 2008: Timothy Bourke, NICTA
    26   Performance improvement (factor 50) for find_theorems.
    27 
    28 * 2008: Florian Haftmann, TUM
    29   Various extensions and restructurings in HOL, improvements
    30   in evaluation mechanisms, new module binding.ML for name bindings.
    31 
    32 * October 2008: Fabian Immler, TUM
    33   ATP manager for Sledgehammer, based on ML threads instead of Posix
    34   processes.  Additional ATP wrappers, including remote SystemOnTPTP
    35   services.
    36 
    37 * August 2008: Fabian Immler, TUM
    38   Vampire wrapper script for remote SystemOnTPTP service.
    39 
    40 
    41 Contributions to Isabelle2008
    42 -----------------------------
    43 
    44 * 2007/2008:
    45   Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
    46   HOL library improvements.
    47 
    48 * 2007/2008: Brian Huffman, PSU
    49   HOLCF library improvements.
    50 
    51 * 2007/2008: Stefan Berghofer, TUM
    52   HOL-Nominal package improvements.  
    53 
    54 * March 2008: Markus Reiter, TUM
    55   HOL/Library/RBT: red-black trees.
    56 
    57 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
    58   Lukas Bulwahn, TUM and John Matthews, Galois:
    59   HOL/Library/Imperative_HOL: Haskell-style imperative data structures
    60   for HOL.
    61 
    62 * December 2007: Norbert Schirmer, Uni Saarbruecken
    63   Misc improvements of record package in HOL.
    64 
    65 * December 2007: Florian Haftmann, TUM
    66   Overloading and class instantiation target.
    67 
    68 * December 2007: Florian Haftmann, TUM
    69   New version of primrec package for local theories.
    70 
    71 * December 2007: Alexander Krauss, TUM
    72   Method "induction_scheme" in HOL.
    73 
    74 * November 2007: Peter Lammich, Uni Muenster
    75   HOL-Lattice: some more lemmas.
    76 
    77 
    78 Contributions to Isabelle2007
    79 -----------------------------
    80 
    81 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
    82   State Spaces: The Locale Way (in HOL).
    83 
    84 * October 2007: Mark A. Hillebrand, DFKI
    85   Robust sub/superscripts in LaTeX document output.
    86 
    87 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
    88     Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
    89   HOL-Word: a library for fixed-size machine words in Isabelle.
    90 
    91 * August 2007: Brian Huffman, PSU
    92   HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
    93 
    94 * June 2007: Amine Chaieb, TUM
    95   Semiring normalization and Groebner Bases.
    96   Support for dense linear orders.
    97 
    98 * June 2007: Joe Hurd, Oxford
    99   Metis theorem-prover.
   100 
   101 * 2007: Kong W. Susanto, Cambridge
   102   HOL: Metis prover integration.
   103 
   104 * 2007: Stefan Berghofer, TUM
   105   HOL: inductive predicates and sets.
   106 
   107 * 2007: Norbert Schirmer, TUM
   108   HOL/record: misc improvements.
   109 
   110 * 2006/2007: Alexander Krauss, TUM
   111   HOL: function package and related theories on termination.
   112 
   113 * 2006/2007: Florian Haftmann, TUM
   114   Pure: generic code generator framework.
   115   Pure: class package.
   116   HOL: theory reorganization, code generator setup.
   117 
   118 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
   119     Julien Narboux, TUM
   120   HOL/Nominal package and related tools.
   121 
   122 * November 2006: Lukas Bulwahn, TUM
   123   HOL: method "lexicographic_order" for function package.
   124 
   125 * October 2006: Stefan Hohe, TUM
   126   HOL-Algebra: ideals and quotients over rings.
   127 
   128 * August 2006: Amine Chaieb, TUM
   129   Experimental support for generic reflection and reification in HOL.
   130 
   131 * July 2006: Rafal Kolanski, NICTA
   132   Hex (0xFF) and binary (0b1011) numerals.
   133 
   134 * May 2006: Klaus Aehlig, LMU
   135   Command 'normal_form': normalization by evaluation.
   136 
   137 * May 2006: Amine Chaieb, TUM
   138   HOL-Complex: Ferrante and Rackoff Algorithm for linear real
   139   arithmetic.
   140 
   141 * February 2006: Benjamin Porter, NICTA
   142   HOL and HOL-Complex: generalised mean value theorem, continuum is
   143   not denumerable, harmonic and arithmetic series, and denumerability
   144   of rationals.
   145 
   146 * October 2005: Martin Wildmoser, TUM
   147   Sketch for Isar 'guess' element.
   148 
   149 
   150 Contributions to Isabelle2005
   151 -----------------------------
   152 
   153 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
   154   HOL-Complex: Formalization of Taylor series.
   155 
   156 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
   157   Components for SAT solver method using zChaff.
   158 
   159 * September 2005: Ning Zhang and Christian Urban, LMU Munich
   160   A Chinese theory.
   161 
   162 * September 2005: Bernhard Haeupler, TUM
   163   Method comm_ring for proving equalities in commutative rings.
   164 
   165 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
   166   Various improvements of the HOL and HOL-Complex library.
   167 
   168 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
   169   Some structured proofs about completeness of real numbers.
   170 
   171 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
   172   Improved retrieval of facts from theory/proof context.
   173 
   174 * February 2005: Lucas Dixon, University of Edinburgh
   175   Improved subst method.
   176 
   177 * 2005: Brian Huffman, OGI
   178   Various improvements of HOLCF.
   179   Some improvements of the HOL-Complex library.
   180 
   181 * 2005: Claire Quigley and Jia Meng, University of Cambridge
   182   Some support for asynchronous communication with external provers
   183   (experimental).
   184 
   185 * 2005: Florian Haftmann, TUM
   186   Contributions to document 'sugar'.
   187   Various ML combinators, notably linear functional transformations.
   188   Some cleanup of ML legacy.
   189   Additional antiquotations.
   190   Improved Isabelle web site.
   191 
   192 * 2004/2005: David Aspinall, University of Edinburgh
   193   Various elements of XML and PGIP based communication with user
   194   interfaces (experimental).
   195 
   196 * 2004/2005: Gerwin Klein, NICTA
   197   Contributions to document 'sugar'.
   198   Improved Isabelle web site.
   199   Improved HTML presentation of theories.
   200 
   201 * 2004/2005: Clemens Ballarin, TUM
   202   Provers: tools for transitive relations and quasi orders.
   203   Improved version of locales, notably interpretation of locales.
   204   Improved version of HOL-Algebra.
   205 
   206 * 2004/2005: Amine Chaieb, TUM
   207   Improved version of HOL presburger method.
   208 
   209 * 2004/2005: Steven Obua, TUM
   210   Improved version of HOL/Import, support for HOL-Light.
   211   Improved version of HOL-Complex-Matrix.
   212   Pure/defs: more sophisticated checks on well-formedness of overloading.
   213   Pure/Tools: an experimental evaluator for lambda terms.
   214 
   215 * 2004/2005: Norbert Schirmer, TUM
   216   Contributions to document 'sugar'.
   217   Improved version of HOL/record.
   218 
   219 * 2004/2005: Sebastian Skalberg, TUM
   220   Improved version of HOL/Import.
   221   Some internal ML reorganizations.
   222 
   223 * 2004/2005: Tjark Weber, TUM
   224   SAT solver method using zChaff.
   225   Improved version of HOL/refute.