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