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