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