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