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