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