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