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