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