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