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