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