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