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