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