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