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