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