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