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