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