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