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