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