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 --------------------------------------
9 * June 2014: Florian Haftmann, TUM
10 Consolidation and generalization of facts concerning products (resp. sums)
13 * June 2014: Florian Haftmann, TUM
14 Internal reorganisation of the local theory / named target stack.
16 * Summer 2014: Mathias Fleury, ENS Rennes, and Albert Steckermeier, TUM
17 Work on exotic automatic theorem provers for Sledgehammer (LEO-II, veriT,
20 * June 2014: Sudeep Kanav, TUM, Jeremy Avigad, CMU, and Johannes Hölzl, TUM
21 Various properties of exponentially, Erlang, and normal distributed random variables.
23 * May 2014: Cezary Kaliszyk, University of Innsbruck, and Jasmin Blanchette, TUM
24 SML-based engines for MaSh.
26 * March 2014: René Thiemann
27 Improved code generation for multisets.
29 * February 2014: Florian Haftmann, TUM
30 Permanent interpretation inside theory, locale and class targets with mixin definitions.
32 * Fall 2013 and Winter 2014: Martin Desharnais, Lorenz Panny, Dmitriy Traytel,
33 and Jasmin Blanchette, TUM
34 Various improvements to the BNF-based (co)datatype package, including
35 a more polished "primcorec" command, optimizations, and integration in
38 * Winter/Spring 2014: Sascha Boehme, QAware GmbH, and Jasmin Blanchette, TUM
39 "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and Z3 4.3.
41 * January 2014: Lars Hupel, TUM
42 An improved, interactive simplifier trace with integration into the
43 Isabelle/jEdit Prover IDE.
45 * December 2013: Florian Haftmann, TUM
46 Consolidation of abstract interpretations concerning min and max.
48 * November 2013: Florian Haftmann, TUM
49 Abolition of negative numeral literals in the logic.
52 Contributions to Isabelle2013-1
53 -------------------------------
55 * September 2013: Lars Noschinski, TUM
56 Conversion between function definitions as list of equations and
57 case expressions in HOL.
58 New library Simps_Case_Conv with commands case_of_simps,
61 * September 2013: Nik Sultana, University of Cambridge
62 Improvements to HOL/TPTP parser and import facilities.
64 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
65 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
67 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
68 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
70 * Summer 2013: Manuel Eberl, TUM
71 Generation of elimination rules in the function package.
72 New command "fun_cases".
74 * Summer 2013: Christian Sternagel, JAIST
75 Improved support for ad hoc overloading of constants, including
76 documentation and examples.
78 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
79 Jasmin Blanchette, TUM
80 Various improvements to the BNF-based (co)datatype package, including
81 "primrec_new" and "primcorec" commands and a compatibility layer.
83 * Spring and Summer 2013: Ondrej Kuncar, TUM
84 Various improvements of Lifting and Transfer packages.
86 * Spring 2013: Brian Huffman, Galois Inc.
87 Improvements of the Transfer package.
89 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
90 Jasmin Blanchette, TUM
91 Various improvements to MaSh, including a server mode.
93 * First half of 2013: Steffen Smolka, TUM
94 Further improvements to Sledgehammer's Isar proof generator.
96 * May 2013: Florian Haftmann, TUM
97 Ephemeral interpretation in local theories.
99 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
100 Spec_Check: A Quickcheck tool for Isabelle/ML.
102 * April 2013: Stefan Berghofer, secunet Security Networks AG
104 Makarius Wenzel, Université Paris-Sud / LRI
105 Case translations as a separate check phase independent of the
108 * March 2013: Florian Haftmann, TUM
109 Reform of "big operators" on sets.
111 * March 2013: Florian Haftmann, TUM
112 Algebraic locale hierarchy for orderings and (semi)lattices.
114 * February 2013: Florian Haftmann, TUM
115 Reworking and consolidation of code generation for target language
118 * February 2013: Florian Haftmann, TUM
119 Sieve of Eratosthenes.
122 Contributions to Isabelle2013
123 -----------------------------
125 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
126 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
128 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
129 Jasmin Blanchette, TUM
130 Implemented Machine Learning for Sledgehammer (MaSh).
132 * Fall 2012: Steffen Smolka, TUM
133 Various improvements to Sledgehammer's Isar proof generator,
134 including a smart type annotation algorithm and proof shrinking.
136 * December 2012: Alessandro Coglio, Kestrel
137 Contributions to HOL's Lattice library.
139 * November 2012: Fabian Immler, TUM
140 "Symbols" dockable for Isabelle/jEdit.
142 * November 2012: Fabian Immler, TUM
143 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
144 of projective families.
146 * October 2012: Andreas Lochbihler, KIT
147 Efficient construction of red-black trees from sorted associative
150 * September 2012: Florian Haftmann, TUM
151 Lattice instances for type option.
153 * September 2012: Christian Sternagel, JAIST
154 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
155 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
157 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
158 New BNF-based (co)datatype package.
160 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
161 Theories of ordinals and cardinals.
163 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
164 Advanced support for Isabelle sessions and build management, notably
167 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
168 Simproc for rewriting set comprehensions into pointfree expressions.
170 * May 2012: Andreas Lochbihler, KIT
171 Theory of almost everywhere constant functions.
173 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
174 Graphview in Scala/Swing.
177 Contributions to Isabelle2012
178 -----------------------------
180 * April 2012: Johannes Hölzl, TUM
181 Probability: Introduced type to represent measures instead of
184 * April 2012: Johannes Hölzl, Fabian Immler, TUM
185 Float: Moved to Dyadic rationals to represent floating point numers.
187 * April 2012: Thomas Sewell, NICTA and
188 2010: Sascha Boehme, TUM
189 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
190 equalities/inequalities.
192 * March 2012: Christian Sternagel, JAIST
193 Consolidated theory of relation composition.
195 * March 2012: Nik Sultana, University of Cambridge
196 HOL/TPTP parser and import facilities.
198 * March 2012: Cezary Kaliszyk, University of Innsbruck and
199 Alexander Krauss, QAware GmbH
200 Faster and more scalable Import mechanism for HOL Light proofs.
202 * January 2012: Florian Haftmann, TUM, et al.
203 (Re-)Introduction of the "set" type constructor.
205 * 2012: Ondrej Kuncar, TUM
206 New package Lifting, various improvements and refinements to the
209 * 2011/2012: Jasmin Blanchette, TUM
210 Various improvements to Sledgehammer, notably: tighter integration
211 with SPASS, support for more provers (Alt-Ergo, iProver,
214 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
215 Various refinements of local theory infrastructure.
216 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
219 Contributions to Isabelle2011-1
220 -------------------------------
222 * September 2011: Peter Gammie
223 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
225 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
226 Refined theory on complete lattices.
228 * August 2011: Brian Huffman, Portland State University
229 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
231 * June 2011: Brian Huffman, Portland State University
232 Proof method "countable_datatype" for theory Library/Countable.
234 * 2011: Jasmin Blanchette, TUM
235 Various improvements to Sledgehammer, notably: use of sound
236 translations, support for more provers (Waldmeister, LEO-II,
237 Satallax). Further development of Nitpick and 'try' command.
239 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
240 Theory HOL/Library/Cset_Monad allows do notation for computable sets
241 (cset) via the generic monad ad-hoc overloading facility.
243 * 2011: Johannes Hölzl, Armin Heller, TUM and
244 Bogdan Grechuk, University of Edinburgh
245 Theory HOL/Library/Extended_Reals: real numbers extended with plus
248 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
249 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
253 Contributions to Isabelle2011
254 -----------------------------
256 * January 2011: Stefan Berghofer, secunet Security Networks AG
257 HOL-SPARK: an interactive prover back-end for SPARK.
259 * October 2010: Bogdan Grechuk, University of Edinburgh
260 Extended convex analysis in Multivariate Analysis.
262 * October 2010: Dmitriy Traytel, TUM
263 Coercive subtyping via subtype constraints.
265 * October 2010: Alexander Krauss, TUM
266 Command partial_function for function definitions based on complete
267 partial orders in HOL.
269 * September 2010: Florian Haftmann, TUM
270 Refined concepts for evaluation, i.e., normalization of terms using
271 different techniques.
273 * September 2010: Florian Haftmann, TUM
274 Code generation for Scala.
276 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
277 Improved Probability theory in HOL.
279 * July 2010: Florian Haftmann, TUM
280 Reworking and extension of the Imperative HOL framework.
282 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
284 Ad-hoc overloading. Generic do notation for monads.
287 Contributions to Isabelle2009-2
288 -------------------------------
290 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
291 Makarius Wenzel, TUM / LRI
292 Elimination of type classes from proof terms.
294 * April 2010: Florian Haftmann, TUM
295 Reorganization of abstract algebra type classes.
297 * April 2010: Florian Haftmann, TUM
298 Code generation for data representations involving invariants;
299 various collections avaiable in theories Fset, Dlist, RBT,
300 Mapping and AssocList.
302 * March 2010: Sascha Boehme, TUM
303 Efficient SHA1 library for Poly/ML.
305 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
306 Quotient type package for Isabelle/HOL.
309 Contributions to Isabelle2009-1
310 -------------------------------
312 * November 2009, Brian Huffman, PSU
313 New definitional domain package for HOLCF.
315 * November 2009: Robert Himmelmann, TUM
316 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
318 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
319 A tabled implementation of the reflexive transitive closure.
321 * November 2009: Lukas Bulwahn, TUM
322 Predicate Compiler: a compiler for inductive predicates to
323 equational specifications.
325 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
326 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
328 * October 2009: Jasmin Blanchette, TUM
329 Nitpick: yet another counterexample generator for Isabelle/HOL.
331 * October 2009: Sascha Boehme, TUM
332 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
334 * October 2009: Florian Haftmann, TUM
335 Refinement of parts of the HOL datatype package.
337 * October 2009: Florian Haftmann, TUM
338 Generic term styles for term antiquotations.
340 * September 2009: Thomas Sewell, NICTA
341 More efficient HOL/record implementation.
343 * September 2009: Sascha Boehme, TUM
344 SMT method using external SMT solvers.
346 * September 2009: Florian Haftmann, TUM
347 Refinement of sets and lattices.
349 * July 2009: Jeremy Avigad and Amine Chaieb
352 * July 2009: Philipp Meyer, TUM
353 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
356 * July 2009: Florian Haftmann, TUM
357 New quickcheck implementation using new code generator.
359 * July 2009: Florian Haftmann, TUM
360 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
363 * June 2009: Florian Haftmann, TUM
364 HOL/Library/Tree: search trees implementing mappings, ready to use
367 * March 2009: Philipp Meyer, TUM
368 Minimization tool for results from Sledgehammer.
371 Contributions to Isabelle2009
372 -----------------------------
374 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
376 Elementary topology in Euclidean space.
378 * March 2009: Johannes Hoelzl, TUM
379 Method "approximation", which proves real valued inequalities by
382 * February 2009: Filip Maric, Univ. of Belgrade
385 * February 2009: Jasmin Christian Blanchette, TUM
386 Misc cleanup of HOL/refute.
388 * February 2009: Timothy Bourke, NICTA
389 New find_consts command.
391 * February 2009: Timothy Bourke, NICTA
392 "solves" criterion for find_theorems and auto_solve option
394 * December 2008: Clemens Ballarin, TUM
395 New locale implementation.
397 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
398 Method "sizechange" for advanced termination proofs.
400 * November 2008: Timothy Bourke, NICTA
401 Performance improvement (factor 50) for find_theorems.
403 * 2008: Florian Haftmann, TUM
404 Various extensions and restructurings in HOL, improvements
405 in evaluation mechanisms, new module binding.ML for name bindings.
407 * October 2008: Fabian Immler, TUM
408 ATP manager for Sledgehammer, based on ML threads instead of Posix
409 processes. Additional ATP wrappers, including remote SystemOnTPTP
412 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
413 Prover for coherent logic.
415 * August 2008: Fabian Immler, TUM
416 Vampire wrapper script for remote SystemOnTPTP service.
419 Contributions to Isabelle2008
420 -----------------------------
423 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
424 HOL library improvements.
426 * 2007/2008: Brian Huffman, PSU
427 HOLCF library improvements.
429 * 2007/2008: Stefan Berghofer, TUM
430 HOL-Nominal package improvements.
432 * March 2008: Markus Reiter, TUM
433 HOL/Library/RBT: red-black trees.
435 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
436 Lukas Bulwahn, TUM and John Matthews, Galois:
437 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
440 * December 2007: Norbert Schirmer, Uni Saarbruecken
441 Misc improvements of record package in HOL.
443 * December 2007: Florian Haftmann, TUM
444 Overloading and class instantiation target.
446 * December 2007: Florian Haftmann, TUM
447 New version of primrec package for local theories.
449 * December 2007: Alexander Krauss, TUM
450 Method "induction_scheme" in HOL.
452 * November 2007: Peter Lammich, Uni Muenster
453 HOL-Lattice: some more lemmas.
456 Contributions to Isabelle2007
457 -----------------------------
459 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
460 State Spaces: The Locale Way (in HOL).
462 * October 2007: Mark A. Hillebrand, DFKI
463 Robust sub/superscripts in LaTeX document output.
465 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
466 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
467 HOL-Word: a library for fixed-size machine words in Isabelle.
469 * August 2007: Brian Huffman, PSU
470 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
472 * June 2007: Amine Chaieb, TUM
473 Semiring normalization and Groebner Bases.
474 Support for dense linear orders.
476 * June 2007: Joe Hurd, Oxford
477 Metis theorem-prover.
479 * 2007: Kong W. Susanto, Cambridge
480 HOL: Metis prover integration.
482 * 2007: Stefan Berghofer, TUM
483 HOL: inductive predicates and sets.
485 * 2007: Norbert Schirmer, TUM
486 HOL/record: misc improvements.
488 * 2006/2007: Alexander Krauss, TUM
489 HOL: function package and related theories on termination.
491 * 2006/2007: Florian Haftmann, TUM
492 Pure: generic code generator framework.
494 HOL: theory reorganization, code generator setup.
496 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
498 HOL/Nominal package and related tools.
500 * November 2006: Lukas Bulwahn, TUM
501 HOL: method "lexicographic_order" for function package.
503 * October 2006: Stefan Hohe, TUM
504 HOL-Algebra: ideals and quotients over rings.
506 * August 2006: Amine Chaieb, TUM
507 Experimental support for generic reflection and reification in HOL.
509 * July 2006: Rafal Kolanski, NICTA
510 Hex (0xFF) and binary (0b1011) numerals.
512 * May 2006: Klaus Aehlig, LMU
513 Command 'normal_form': normalization by evaluation.
515 * May 2006: Amine Chaieb, TUM
516 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
519 * February 2006: Benjamin Porter, NICTA
520 HOL and HOL-Complex: generalised mean value theorem, continuum is
521 not denumerable, harmonic and arithmetic series, and denumerability
524 * October 2005: Martin Wildmoser, TUM
525 Sketch for Isar 'guess' element.
528 Contributions to Isabelle2005
529 -----------------------------
531 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
532 HOL-Complex: Formalization of Taylor series.
534 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
535 Components for SAT solver method using zChaff.
537 * September 2005: Ning Zhang and Christian Urban, LMU Munich
540 * September 2005: Bernhard Haeupler, TUM
541 Method comm_ring for proving equalities in commutative rings.
543 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
544 Various improvements of the HOL and HOL-Complex library.
546 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
547 Some structured proofs about completeness of real numbers.
549 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
550 Improved retrieval of facts from theory/proof context.
552 * February 2005: Lucas Dixon, University of Edinburgh
553 Improved subst method.
555 * 2005: Brian Huffman, OGI
556 Various improvements of HOLCF.
557 Some improvements of the HOL-Complex library.
559 * 2005: Claire Quigley and Jia Meng, University of Cambridge
560 Some support for asynchronous communication with external provers
563 * 2005: Florian Haftmann, TUM
564 Contributions to document 'sugar'.
565 Various ML combinators, notably linear functional transformations.
566 Some cleanup of ML legacy.
567 Additional antiquotations.
568 Improved Isabelle web site.
570 * 2004/2005: David Aspinall, University of Edinburgh
571 Various elements of XML and PGIP based communication with user
572 interfaces (experimental).
574 * 2004/2005: Gerwin Klein, NICTA
575 Contributions to document 'sugar'.
576 Improved Isabelle web site.
577 Improved HTML presentation of theories.
579 * 2004/2005: Clemens Ballarin, TUM
580 Provers: tools for transitive relations and quasi orders.
581 Improved version of locales, notably interpretation of locales.
582 Improved version of HOL-Algebra.
584 * 2004/2005: Amine Chaieb, TUM
585 Improved version of HOL presburger method.
587 * 2004/2005: Steven Obua, TUM
588 Improved version of HOL/Import, support for HOL-Light.
589 Improved version of HOL-Complex-Matrix.
590 Pure/defs: more sophisticated checks on well-formedness of overloading.
591 Pure/Tools: an experimental evaluator for lambda terms.
593 * 2004/2005: Norbert Schirmer, TUM
594 Contributions to document 'sugar'.
595 Improved version of HOL/record.
597 * 2004/2005: Sebastian Skalberg, TUM
598 Improved version of HOL/Import.
599 Some internal ML reorganizations.
601 * 2004/2005: Tjark Weber, TUM
602 SAT solver method using zChaff.
603 Improved version of HOL/refute.