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