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