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