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