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