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