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