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