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