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