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