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