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