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