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