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