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