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