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