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 Isabelle2014
7 -----------------------------
9 * July 2014: Thomas Sewell, NICTA
10 Preserve equality hypotheses in "clarify" and friends. New
11 "hypsubst_thin" method configuration option.
13 * Summer 2014: Florian Haftmann, TUM
14 Consolidation and generalization of facts concerning (abelian)
15 semigroups and monoids, particularly products (resp. sums) on
18 * Summer 2014: Mathias Fleury, ENS Rennes, and Albert Steckermeier, TUM
19 Work on exotic automatic theorem provers for Sledgehammer (LEO-II,
20 veriT, Waldmeister, etc.).
22 * June 2014: Florian Haftmann, TUM
23 Internal reorganisation of the local theory / named target stack.
25 * June 2014: Sudeep Kanav, TUM, Jeremy Avigad, CMU, and Johannes Hölzl, TUM
26 Various properties of exponentially, Erlang, and normal distributed
29 * May 2014: Cezary Kaliszyk, University of Innsbruck, and
30 Jasmin Blanchette, TUM
31 SML-based engines for MaSh.
33 * March 2014: René Thiemann
34 Improved code generation for multisets.
36 * February 2014: Florian Haftmann, TUM
37 Permanent interpretation inside theory, locale and class targets
38 with mixin definitions.
40 * Spring 2014: Lawrence C Paulson, Cambridge
41 Theory Complex_Basic_Analysis. Tidying up Number_Theory vs Old_Number_Theory
43 * Winter 2013 and Spring 2014: Ondrej Kuncar, TUM
44 Various improvements to Lifting/Transfer, integration with the BNF package.
46 * Winter 2013 and Spring 2014: Makarius Wenzel, Université Paris-Sud / LRI
47 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
49 * Fall 2013 and Winter 2014: Martin Desharnais, Lorenz Panny,
50 Dmitriy Traytel, and Jasmin Blanchette, TUM
51 Various improvements to the BNF-based (co)datatype package,
52 including a more polished "primcorec" command, optimizations, and
53 integration in the "HOL" session.
55 * Winter/Spring 2014: Sascha Boehme, QAware GmbH, and
56 Jasmin Blanchette, TUM
57 "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and
60 * January 2014: Lars Hupel, TUM
61 An improved, interactive simplifier trace with integration into the
62 Isabelle/jEdit Prover IDE.
64 * December 2013: Florian Haftmann, TUM
65 Consolidation of abstract interpretations concerning min and max.
67 * November 2013: Florian Haftmann, TUM
68 Abolition of negative numeral literals in the logic.
71 Contributions to Isabelle2013-1
72 -------------------------------
74 * September 2013: Lars Noschinski, TUM
75 Conversion between function definitions as list of equations and
76 case expressions in HOL.
77 New library Simps_Case_Conv with commands case_of_simps,
80 * September 2013: Nik Sultana, University of Cambridge
81 Improvements to HOL/TPTP parser and import facilities.
83 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
84 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
86 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
87 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
89 * Summer 2013: Manuel Eberl, TUM
90 Generation of elimination rules in the function package.
91 New command "fun_cases".
93 * Summer 2013: Christian Sternagel, JAIST
94 Improved support for ad hoc overloading of constants, including
95 documentation and examples.
97 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
98 Jasmin Blanchette, TUM
99 Various improvements to the BNF-based (co)datatype package, including
100 "primrec_new" and "primcorec" commands and a compatibility layer.
102 * Spring and Summer 2013: Ondrej Kuncar, TUM
103 Various improvements of Lifting and Transfer packages.
105 * Spring 2013: Brian Huffman, Galois Inc.
106 Improvements of the Transfer package.
108 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
109 Jasmin Blanchette, TUM
110 Various improvements to MaSh, including a server mode.
112 * First half of 2013: Steffen Smolka, TUM
113 Further improvements to Sledgehammer's Isar proof generator.
115 * May 2013: Florian Haftmann, TUM
116 Ephemeral interpretation in local theories.
118 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
119 Spec_Check: A Quickcheck tool for Isabelle/ML.
121 * April 2013: Stefan Berghofer, secunet Security Networks AG
123 Makarius Wenzel, Université Paris-Sud / LRI
124 Case translations as a separate check phase independent of the
127 * March 2013: Florian Haftmann, TUM
128 Reform of "big operators" on sets.
130 * March 2013: Florian Haftmann, TUM
131 Algebraic locale hierarchy for orderings and (semi)lattices.
133 * February 2013: Florian Haftmann, TUM
134 Reworking and consolidation of code generation for target language
137 * February 2013: Florian Haftmann, TUM
138 Sieve of Eratosthenes.
141 Contributions to Isabelle2013
142 -----------------------------
144 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
145 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
147 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
148 Jasmin Blanchette, TUM
149 Implemented Machine Learning for Sledgehammer (MaSh).
151 * Fall 2012: Steffen Smolka, TUM
152 Various improvements to Sledgehammer's Isar proof generator,
153 including a smart type annotation algorithm and proof shrinking.
155 * December 2012: Alessandro Coglio, Kestrel
156 Contributions to HOL's Lattice library.
158 * November 2012: Fabian Immler, TUM
159 "Symbols" dockable for Isabelle/jEdit.
161 * November 2012: Fabian Immler, TUM
162 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
163 of projective families.
165 * October 2012: Andreas Lochbihler, KIT
166 Efficient construction of red-black trees from sorted associative
169 * September 2012: Florian Haftmann, TUM
170 Lattice instances for type option.
172 * September 2012: Christian Sternagel, JAIST
173 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
174 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
176 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
177 New BNF-based (co)datatype package.
179 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
180 Theories of ordinals and cardinals.
182 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
183 Advanced support for Isabelle sessions and build management, notably
186 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
187 Simproc for rewriting set comprehensions into pointfree expressions.
189 * May 2012: Andreas Lochbihler, KIT
190 Theory of almost everywhere constant functions.
192 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
193 Graphview in Scala/Swing.
196 Contributions to Isabelle2012
197 -----------------------------
199 * April 2012: Johannes Hölzl, TUM
200 Probability: Introduced type to represent measures instead of
203 * April 2012: Johannes Hölzl, Fabian Immler, TUM
204 Float: Moved to Dyadic rationals to represent floating point numers.
206 * April 2012: Thomas Sewell, NICTA and
207 2010: Sascha Boehme, TUM
208 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
209 equalities/inequalities.
211 * March 2012: Christian Sternagel, JAIST
212 Consolidated theory of relation composition.
214 * March 2012: Nik Sultana, University of Cambridge
215 HOL/TPTP parser and import facilities.
217 * March 2012: Cezary Kaliszyk, University of Innsbruck and
218 Alexander Krauss, QAware GmbH
219 Faster and more scalable Import mechanism for HOL Light proofs.
221 * January 2012: Florian Haftmann, TUM, et al.
222 (Re-)Introduction of the "set" type constructor.
224 * 2012: Ondrej Kuncar, TUM
225 New package Lifting, various improvements and refinements to the
228 * 2011/2012: Jasmin Blanchette, TUM
229 Various improvements to Sledgehammer, notably: tighter integration
230 with SPASS, support for more provers (Alt-Ergo, iProver,
233 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
234 Various refinements of local theory infrastructure.
235 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
238 Contributions to Isabelle2011-1
239 -------------------------------
241 * September 2011: Peter Gammie
242 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
244 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
245 Refined theory on complete lattices.
247 * August 2011: Brian Huffman, Portland State University
248 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
250 * June 2011: Brian Huffman, Portland State University
251 Proof method "countable_datatype" for theory Library/Countable.
253 * 2011: Jasmin Blanchette, TUM
254 Various improvements to Sledgehammer, notably: use of sound
255 translations, support for more provers (Waldmeister, LEO-II,
256 Satallax). Further development of Nitpick and 'try' command.
258 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
259 Theory HOL/Library/Cset_Monad allows do notation for computable sets
260 (cset) via the generic monad ad-hoc overloading facility.
262 * 2011: Johannes Hölzl, Armin Heller, TUM and
263 Bogdan Grechuk, University of Edinburgh
264 Theory HOL/Library/Extended_Reals: real numbers extended with plus
267 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
268 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
272 Contributions to Isabelle2011
273 -----------------------------
275 * January 2011: Stefan Berghofer, secunet Security Networks AG
276 HOL-SPARK: an interactive prover back-end for SPARK.
278 * October 2010: Bogdan Grechuk, University of Edinburgh
279 Extended convex analysis in Multivariate Analysis.
281 * October 2010: Dmitriy Traytel, TUM
282 Coercive subtyping via subtype constraints.
284 * October 2010: Alexander Krauss, TUM
285 Command partial_function for function definitions based on complete
286 partial orders in HOL.
288 * September 2010: Florian Haftmann, TUM
289 Refined concepts for evaluation, i.e., normalization of terms using
290 different techniques.
292 * September 2010: Florian Haftmann, TUM
293 Code generation for Scala.
295 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
296 Improved Probability theory in HOL.
298 * July 2010: Florian Haftmann, TUM
299 Reworking and extension of the Imperative HOL framework.
301 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
303 Ad-hoc overloading. Generic do notation for monads.
306 Contributions to Isabelle2009-2
307 -------------------------------
309 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
310 Makarius Wenzel, TUM / LRI
311 Elimination of type classes from proof terms.
313 * April 2010: Florian Haftmann, TUM
314 Reorganization of abstract algebra type classes.
316 * April 2010: Florian Haftmann, TUM
317 Code generation for data representations involving invariants;
318 various collections avaiable in theories Fset, Dlist, RBT,
319 Mapping and AssocList.
321 * March 2010: Sascha Boehme, TUM
322 Efficient SHA1 library for Poly/ML.
324 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
325 Quotient type package for Isabelle/HOL.
328 Contributions to Isabelle2009-1
329 -------------------------------
331 * November 2009, Brian Huffman, PSU
332 New definitional domain package for HOLCF.
334 * November 2009: Robert Himmelmann, TUM
335 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
337 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
338 A tabled implementation of the reflexive transitive closure.
340 * November 2009: Lukas Bulwahn, TUM
341 Predicate Compiler: a compiler for inductive predicates to
342 equational specifications.
344 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
345 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
347 * October 2009: Jasmin Blanchette, TUM
348 Nitpick: yet another counterexample generator for Isabelle/HOL.
350 * October 2009: Sascha Boehme, TUM
351 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
353 * October 2009: Florian Haftmann, TUM
354 Refinement of parts of the HOL datatype package.
356 * October 2009: Florian Haftmann, TUM
357 Generic term styles for term antiquotations.
359 * September 2009: Thomas Sewell, NICTA
360 More efficient HOL/record implementation.
362 * September 2009: Sascha Boehme, TUM
363 SMT method using external SMT solvers.
365 * September 2009: Florian Haftmann, TUM
366 Refinement of sets and lattices.
368 * July 2009: Jeremy Avigad and Amine Chaieb
371 * July 2009: Philipp Meyer, TUM
372 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
375 * July 2009: Florian Haftmann, TUM
376 New quickcheck implementation using new code generator.
378 * July 2009: Florian Haftmann, TUM
379 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
382 * June 2009: Florian Haftmann, TUM
383 HOL/Library/Tree: search trees implementing mappings, ready to use
386 * March 2009: Philipp Meyer, TUM
387 Minimization tool for results from Sledgehammer.
390 Contributions to Isabelle2009
391 -----------------------------
393 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
395 Elementary topology in Euclidean space.
397 * March 2009: Johannes Hoelzl, TUM
398 Method "approximation", which proves real valued inequalities by
401 * February 2009: Filip Maric, Univ. of Belgrade
404 * February 2009: Jasmin Christian Blanchette, TUM
405 Misc cleanup of HOL/refute.
407 * February 2009: Timothy Bourke, NICTA
408 New find_consts command.
410 * February 2009: Timothy Bourke, NICTA
411 "solves" criterion for find_theorems and auto_solve option
413 * December 2008: Clemens Ballarin, TUM
414 New locale implementation.
416 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
417 Method "sizechange" for advanced termination proofs.
419 * November 2008: Timothy Bourke, NICTA
420 Performance improvement (factor 50) for find_theorems.
422 * 2008: Florian Haftmann, TUM
423 Various extensions and restructurings in HOL, improvements
424 in evaluation mechanisms, new module binding.ML for name bindings.
426 * October 2008: Fabian Immler, TUM
427 ATP manager for Sledgehammer, based on ML threads instead of Posix
428 processes. Additional ATP wrappers, including remote SystemOnTPTP
431 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
432 Prover for coherent logic.
434 * August 2008: Fabian Immler, TUM
435 Vampire wrapper script for remote SystemOnTPTP service.
438 Contributions to Isabelle2008
439 -----------------------------
442 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
443 HOL library improvements.
445 * 2007/2008: Brian Huffman, PSU
446 HOLCF library improvements.
448 * 2007/2008: Stefan Berghofer, TUM
449 HOL-Nominal package improvements.
451 * March 2008: Markus Reiter, TUM
452 HOL/Library/RBT: red-black trees.
454 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
455 Lukas Bulwahn, TUM and John Matthews, Galois:
456 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
459 * December 2007: Norbert Schirmer, Uni Saarbruecken
460 Misc improvements of record package in HOL.
462 * December 2007: Florian Haftmann, TUM
463 Overloading and class instantiation target.
465 * December 2007: Florian Haftmann, TUM
466 New version of primrec package for local theories.
468 * December 2007: Alexander Krauss, TUM
469 Method "induction_scheme" in HOL.
471 * November 2007: Peter Lammich, Uni Muenster
472 HOL-Lattice: some more lemmas.
475 Contributions to Isabelle2007
476 -----------------------------
478 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
479 State Spaces: The Locale Way (in HOL).
481 * October 2007: Mark A. Hillebrand, DFKI
482 Robust sub/superscripts in LaTeX document output.
484 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
485 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
486 HOL-Word: a library for fixed-size machine words in Isabelle.
488 * August 2007: Brian Huffman, PSU
489 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
491 * June 2007: Amine Chaieb, TUM
492 Semiring normalization and Groebner Bases.
493 Support for dense linear orders.
495 * June 2007: Joe Hurd, Oxford
496 Metis theorem-prover.
498 * 2007: Kong W. Susanto, Cambridge
499 HOL: Metis prover integration.
501 * 2007: Stefan Berghofer, TUM
502 HOL: inductive predicates and sets.
504 * 2007: Norbert Schirmer, TUM
505 HOL/record: misc improvements.
507 * 2006/2007: Alexander Krauss, TUM
508 HOL: function package and related theories on termination.
510 * 2006/2007: Florian Haftmann, TUM
511 Pure: generic code generator framework.
513 HOL: theory reorganization, code generator setup.
515 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
517 HOL/Nominal package and related tools.
519 * November 2006: Lukas Bulwahn, TUM
520 HOL: method "lexicographic_order" for function package.
522 * October 2006: Stefan Hohe, TUM
523 HOL-Algebra: ideals and quotients over rings.
525 * August 2006: Amine Chaieb, TUM
526 Experimental support for generic reflection and reification in HOL.
528 * July 2006: Rafal Kolanski, NICTA
529 Hex (0xFF) and binary (0b1011) numerals.
531 * May 2006: Klaus Aehlig, LMU
532 Command 'normal_form': normalization by evaluation.
534 * May 2006: Amine Chaieb, TUM
535 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
538 * February 2006: Benjamin Porter, NICTA
539 HOL and HOL-Complex: generalised mean value theorem, continuum is
540 not denumerable, harmonic and arithmetic series, and denumerability
543 * October 2005: Martin Wildmoser, TUM
544 Sketch for Isar 'guess' element.
547 Contributions to Isabelle2005
548 -----------------------------
550 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
551 HOL-Complex: Formalization of Taylor series.
553 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
554 Components for SAT solver method using zChaff.
556 * September 2005: Ning Zhang and Christian Urban, LMU Munich
559 * September 2005: Bernhard Haeupler, TUM
560 Method comm_ring for proving equalities in commutative rings.
562 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
563 Various improvements of the HOL and HOL-Complex library.
565 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
566 Some structured proofs about completeness of real numbers.
568 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
569 Improved retrieval of facts from theory/proof context.
571 * February 2005: Lucas Dixon, University of Edinburgh
572 Improved subst method.
574 * 2005: Brian Huffman, OGI
575 Various improvements of HOLCF.
576 Some improvements of the HOL-Complex library.
578 * 2005: Claire Quigley and Jia Meng, University of Cambridge
579 Some support for asynchronous communication with external provers
582 * 2005: Florian Haftmann, TUM
583 Contributions to document 'sugar'.
584 Various ML combinators, notably linear functional transformations.
585 Some cleanup of ML legacy.
586 Additional antiquotations.
587 Improved Isabelle web site.
589 * 2004/2005: David Aspinall, University of Edinburgh
590 Various elements of XML and PGIP based communication with user
591 interfaces (experimental).
593 * 2004/2005: Gerwin Klein, NICTA
594 Contributions to document 'sugar'.
595 Improved Isabelle web site.
596 Improved HTML presentation of theories.
598 * 2004/2005: Clemens Ballarin, TUM
599 Provers: tools for transitive relations and quasi orders.
600 Improved version of locales, notably interpretation of locales.
601 Improved version of HOL-Algebra.
603 * 2004/2005: Amine Chaieb, TUM
604 Improved version of HOL presburger method.
606 * 2004/2005: Steven Obua, TUM
607 Improved version of HOL/Import, support for HOL-Light.
608 Improved version of HOL-Complex-Matrix.
609 Pure/defs: more sophisticated checks on well-formedness of overloading.
610 Pure/Tools: an experimental evaluator for lambda terms.
612 * 2004/2005: Norbert Schirmer, TUM
613 Contributions to document 'sugar'.
614 Improved version of HOL/record.
616 * 2004/2005: Sebastian Skalberg, TUM
617 Improved version of HOL/Import.
618 Some internal ML reorganizations.
620 * 2004/2005: Tjark Weber, TUM
621 SAT solver method using zChaff.
622 Improved version of HOL/refute.