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 * March 2014: René Thiemann
10 Improved code generation for multisets.
12 * February 2014: Florian Haftmann, TUM
13 Permanent interpretation inside theory, locale and class targets with mixin definitions.
15 * Fall 2013 and Winter 2014: Lorenz Panny, Dmitriy Traytel, and
16 Jasmin Blanchette, TUM
17 Various improvements to the BNF-based (co)datatype package, including
18 a more polished "primcorec" command, optimizations, and integration in
21 * Winter 2014: Sascha Boehme, QAware GmbH, and Jasmin Blanchette, TUM
22 "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and Z3 4.3.
24 * January 2014: Lars Hupel, TUM
25 An improved, interactive simplifier trace with integration into the
26 Isabelle/jEdit Prover IDE.
28 * December 2013: Florian Haftmann, TUM
29 Consolidation of abstract interpretations concerning min and max.
31 * November 2013: Florian Haftmann, TUM
32 Abolition of negative numeral literals in the logic.
35 Contributions to Isabelle2013-1
36 -------------------------------
38 * September 2013: Lars Noschinski, TUM
39 Conversion between function definitions as list of equations and
40 case expressions in HOL.
41 New library Simps_Case_Conv with commands case_of_simps,
44 * September 2013: Nik Sultana, University of Cambridge
45 Improvements to HOL/TPTP parser and import facilities.
47 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
48 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
50 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
51 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
53 * Summer 2013: Manuel Eberl, TUM
54 Generation of elimination rules in the function package.
55 New command "fun_cases".
57 * Summer 2013: Christian Sternagel, JAIST
58 Improved support for ad hoc overloading of constants, including
59 documentation and examples.
61 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
62 Jasmin Blanchette, TUM
63 Various improvements to the BNF-based (co)datatype package, including
64 "primrec_new" and "primcorec" commands and a compatibility layer.
66 * Spring and Summer 2013: Ondrej Kuncar, TUM
67 Various improvements of Lifting and Transfer packages.
69 * Spring 2013: Brian Huffman, Galois Inc.
70 Improvements of the Transfer package.
72 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
73 Jasmin Blanchette, TUM
74 Various improvements to MaSh, including a server mode.
76 * First half of 2013: Steffen Smolka, TUM
77 Further improvements to Sledgehammer's Isar proof generator.
79 * May 2013: Florian Haftmann, TUM
80 Ephemeral interpretation in local theories.
82 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
83 Spec_Check: A Quickcheck tool for Isabelle/ML.
85 * April 2013: Stefan Berghofer, secunet Security Networks AG
87 Makarius Wenzel, Université Paris-Sud / LRI
88 Case translations as a separate check phase independent of the
91 * March 2013: Florian Haftmann, TUM
92 Reform of "big operators" on sets.
94 * March 2013: Florian Haftmann, TUM
95 Algebraic locale hierarchy for orderings and (semi)lattices.
97 * February 2013: Florian Haftmann, TUM
98 Reworking and consolidation of code generation for target language
101 * February 2013: Florian Haftmann, TUM
102 Sieve of Eratosthenes.
105 Contributions to Isabelle2013
106 -----------------------------
108 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
109 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
111 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
112 Jasmin Blanchette, TUM
113 Implemented Machine Learning for Sledgehammer (MaSh).
115 * Fall 2012: Steffen Smolka, TUM
116 Various improvements to Sledgehammer's Isar proof generator,
117 including a smart type annotation algorithm and proof shrinking.
119 * December 2012: Alessandro Coglio, Kestrel
120 Contributions to HOL's Lattice library.
122 * November 2012: Fabian Immler, TUM
123 "Symbols" dockable for Isabelle/jEdit.
125 * November 2012: Fabian Immler, TUM
126 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
127 of projective families.
129 * October 2012: Andreas Lochbihler, KIT
130 Efficient construction of red-black trees from sorted associative
133 * September 2012: Florian Haftmann, TUM
134 Lattice instances for type option.
136 * September 2012: Christian Sternagel, JAIST
137 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
138 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
140 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
141 New BNF-based (co)datatype package.
143 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
144 Theories of ordinals and cardinals.
146 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
147 Advanced support for Isabelle sessions and build management, notably
150 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
151 Simproc for rewriting set comprehensions into pointfree expressions.
153 * May 2012: Andreas Lochbihler, KIT
154 Theory of almost everywhere constant functions.
156 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
157 Graphview in Scala/Swing.
160 Contributions to Isabelle2012
161 -----------------------------
163 * April 2012: Johannes Hölzl, TUM
164 Probability: Introduced type to represent measures instead of
167 * April 2012: Johannes Hölzl, Fabian Immler, TUM
168 Float: Moved to Dyadic rationals to represent floating point numers.
170 * April 2012: Thomas Sewell, NICTA and
171 2010: Sascha Boehme, TUM
172 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
173 equalities/inequalities.
175 * March 2012: Christian Sternagel, JAIST
176 Consolidated theory of relation composition.
178 * March 2012: Nik Sultana, University of Cambridge
179 HOL/TPTP parser and import facilities.
181 * March 2012: Cezary Kaliszyk, University of Innsbruck and
182 Alexander Krauss, QAware GmbH
183 Faster and more scalable Import mechanism for HOL Light proofs.
185 * January 2012: Florian Haftmann, TUM, et al.
186 (Re-)Introduction of the "set" type constructor.
188 * 2012: Ondrej Kuncar, TUM
189 New package Lifting, various improvements and refinements to the
192 * 2011/2012: Jasmin Blanchette, TUM
193 Various improvements to Sledgehammer, notably: tighter integration
194 with SPASS, support for more provers (Alt-Ergo, iProver,
197 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
198 Various refinements of local theory infrastructure.
199 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
202 Contributions to Isabelle2011-1
203 -------------------------------
205 * September 2011: Peter Gammie
206 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
208 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
209 Refined theory on complete lattices.
211 * August 2011: Brian Huffman, Portland State University
212 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
214 * June 2011: Brian Huffman, Portland State University
215 Proof method "countable_datatype" for theory Library/Countable.
217 * 2011: Jasmin Blanchette, TUM
218 Various improvements to Sledgehammer, notably: use of sound
219 translations, support for more provers (Waldmeister, LEO-II,
220 Satallax). Further development of Nitpick and 'try' command.
222 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
223 Theory HOL/Library/Cset_Monad allows do notation for computable sets
224 (cset) via the generic monad ad-hoc overloading facility.
226 * 2011: Johannes Hölzl, Armin Heller, TUM and
227 Bogdan Grechuk, University of Edinburgh
228 Theory HOL/Library/Extended_Reals: real numbers extended with plus
231 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
232 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
236 Contributions to Isabelle2011
237 -----------------------------
239 * January 2011: Stefan Berghofer, secunet Security Networks AG
240 HOL-SPARK: an interactive prover back-end for SPARK.
242 * October 2010: Bogdan Grechuk, University of Edinburgh
243 Extended convex analysis in Multivariate Analysis.
245 * October 2010: Dmitriy Traytel, TUM
246 Coercive subtyping via subtype constraints.
248 * October 2010: Alexander Krauss, TUM
249 Command partial_function for function definitions based on complete
250 partial orders in HOL.
252 * September 2010: Florian Haftmann, TUM
253 Refined concepts for evaluation, i.e., normalization of terms using
254 different techniques.
256 * September 2010: Florian Haftmann, TUM
257 Code generation for Scala.
259 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
260 Improved Probability theory in HOL.
262 * July 2010: Florian Haftmann, TUM
263 Reworking and extension of the Imperative HOL framework.
265 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
267 Ad-hoc overloading. Generic do notation for monads.
270 Contributions to Isabelle2009-2
271 -------------------------------
273 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
274 Makarius Wenzel, TUM / LRI
275 Elimination of type classes from proof terms.
277 * April 2010: Florian Haftmann, TUM
278 Reorganization of abstract algebra type classes.
280 * April 2010: Florian Haftmann, TUM
281 Code generation for data representations involving invariants;
282 various collections avaiable in theories Fset, Dlist, RBT,
283 Mapping and AssocList.
285 * March 2010: Sascha Boehme, TUM
286 Efficient SHA1 library for Poly/ML.
288 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
289 Quotient type package for Isabelle/HOL.
292 Contributions to Isabelle2009-1
293 -------------------------------
295 * November 2009, Brian Huffman, PSU
296 New definitional domain package for HOLCF.
298 * November 2009: Robert Himmelmann, TUM
299 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
301 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
302 A tabled implementation of the reflexive transitive closure.
304 * November 2009: Lukas Bulwahn, TUM
305 Predicate Compiler: a compiler for inductive predicates to
306 equational specifications.
308 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
309 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
311 * October 2009: Jasmin Blanchette, TUM
312 Nitpick: yet another counterexample generator for Isabelle/HOL.
314 * October 2009: Sascha Boehme, TUM
315 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
317 * October 2009: Florian Haftmann, TUM
318 Refinement of parts of the HOL datatype package.
320 * October 2009: Florian Haftmann, TUM
321 Generic term styles for term antiquotations.
323 * September 2009: Thomas Sewell, NICTA
324 More efficient HOL/record implementation.
326 * September 2009: Sascha Boehme, TUM
327 SMT method using external SMT solvers.
329 * September 2009: Florian Haftmann, TUM
330 Refinement of sets and lattices.
332 * July 2009: Jeremy Avigad and Amine Chaieb
335 * July 2009: Philipp Meyer, TUM
336 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
339 * July 2009: Florian Haftmann, TUM
340 New quickcheck implementation using new code generator.
342 * July 2009: Florian Haftmann, TUM
343 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
346 * June 2009: Florian Haftmann, TUM
347 HOL/Library/Tree: search trees implementing mappings, ready to use
350 * March 2009: Philipp Meyer, TUM
351 Minimization tool for results from Sledgehammer.
354 Contributions to Isabelle2009
355 -----------------------------
357 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
359 Elementary topology in Euclidean space.
361 * March 2009: Johannes Hoelzl, TUM
362 Method "approximation", which proves real valued inequalities by
365 * February 2009: Filip Maric, Univ. of Belgrade
368 * February 2009: Jasmin Christian Blanchette, TUM
369 Misc cleanup of HOL/refute.
371 * February 2009: Timothy Bourke, NICTA
372 New find_consts command.
374 * February 2009: Timothy Bourke, NICTA
375 "solves" criterion for find_theorems and auto_solve option
377 * December 2008: Clemens Ballarin, TUM
378 New locale implementation.
380 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
381 Method "sizechange" for advanced termination proofs.
383 * November 2008: Timothy Bourke, NICTA
384 Performance improvement (factor 50) for find_theorems.
386 * 2008: Florian Haftmann, TUM
387 Various extensions and restructurings in HOL, improvements
388 in evaluation mechanisms, new module binding.ML for name bindings.
390 * October 2008: Fabian Immler, TUM
391 ATP manager for Sledgehammer, based on ML threads instead of Posix
392 processes. Additional ATP wrappers, including remote SystemOnTPTP
395 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
396 Prover for coherent logic.
398 * August 2008: Fabian Immler, TUM
399 Vampire wrapper script for remote SystemOnTPTP service.
402 Contributions to Isabelle2008
403 -----------------------------
406 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
407 HOL library improvements.
409 * 2007/2008: Brian Huffman, PSU
410 HOLCF library improvements.
412 * 2007/2008: Stefan Berghofer, TUM
413 HOL-Nominal package improvements.
415 * March 2008: Markus Reiter, TUM
416 HOL/Library/RBT: red-black trees.
418 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
419 Lukas Bulwahn, TUM and John Matthews, Galois:
420 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
423 * December 2007: Norbert Schirmer, Uni Saarbruecken
424 Misc improvements of record package in HOL.
426 * December 2007: Florian Haftmann, TUM
427 Overloading and class instantiation target.
429 * December 2007: Florian Haftmann, TUM
430 New version of primrec package for local theories.
432 * December 2007: Alexander Krauss, TUM
433 Method "induction_scheme" in HOL.
435 * November 2007: Peter Lammich, Uni Muenster
436 HOL-Lattice: some more lemmas.
439 Contributions to Isabelle2007
440 -----------------------------
442 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
443 State Spaces: The Locale Way (in HOL).
445 * October 2007: Mark A. Hillebrand, DFKI
446 Robust sub/superscripts in LaTeX document output.
448 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
449 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
450 HOL-Word: a library for fixed-size machine words in Isabelle.
452 * August 2007: Brian Huffman, PSU
453 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
455 * June 2007: Amine Chaieb, TUM
456 Semiring normalization and Groebner Bases.
457 Support for dense linear orders.
459 * June 2007: Joe Hurd, Oxford
460 Metis theorem-prover.
462 * 2007: Kong W. Susanto, Cambridge
463 HOL: Metis prover integration.
465 * 2007: Stefan Berghofer, TUM
466 HOL: inductive predicates and sets.
468 * 2007: Norbert Schirmer, TUM
469 HOL/record: misc improvements.
471 * 2006/2007: Alexander Krauss, TUM
472 HOL: function package and related theories on termination.
474 * 2006/2007: Florian Haftmann, TUM
475 Pure: generic code generator framework.
477 HOL: theory reorganization, code generator setup.
479 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
481 HOL/Nominal package and related tools.
483 * November 2006: Lukas Bulwahn, TUM
484 HOL: method "lexicographic_order" for function package.
486 * October 2006: Stefan Hohe, TUM
487 HOL-Algebra: ideals and quotients over rings.
489 * August 2006: Amine Chaieb, TUM
490 Experimental support for generic reflection and reification in HOL.
492 * July 2006: Rafal Kolanski, NICTA
493 Hex (0xFF) and binary (0b1011) numerals.
495 * May 2006: Klaus Aehlig, LMU
496 Command 'normal_form': normalization by evaluation.
498 * May 2006: Amine Chaieb, TUM
499 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
502 * February 2006: Benjamin Porter, NICTA
503 HOL and HOL-Complex: generalised mean value theorem, continuum is
504 not denumerable, harmonic and arithmetic series, and denumerability
507 * October 2005: Martin Wildmoser, TUM
508 Sketch for Isar 'guess' element.
511 Contributions to Isabelle2005
512 -----------------------------
514 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
515 HOL-Complex: Formalization of Taylor series.
517 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
518 Components for SAT solver method using zChaff.
520 * September 2005: Ning Zhang and Christian Urban, LMU Munich
523 * September 2005: Bernhard Haeupler, TUM
524 Method comm_ring for proving equalities in commutative rings.
526 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
527 Various improvements of the HOL and HOL-Complex library.
529 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
530 Some structured proofs about completeness of real numbers.
532 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
533 Improved retrieval of facts from theory/proof context.
535 * February 2005: Lucas Dixon, University of Edinburgh
536 Improved subst method.
538 * 2005: Brian Huffman, OGI
539 Various improvements of HOLCF.
540 Some improvements of the HOL-Complex library.
542 * 2005: Claire Quigley and Jia Meng, University of Cambridge
543 Some support for asynchronous communication with external provers
546 * 2005: Florian Haftmann, TUM
547 Contributions to document 'sugar'.
548 Various ML combinators, notably linear functional transformations.
549 Some cleanup of ML legacy.
550 Additional antiquotations.
551 Improved Isabelle web site.
553 * 2004/2005: David Aspinall, University of Edinburgh
554 Various elements of XML and PGIP based communication with user
555 interfaces (experimental).
557 * 2004/2005: Gerwin Klein, NICTA
558 Contributions to document 'sugar'.
559 Improved Isabelle web site.
560 Improved HTML presentation of theories.
562 * 2004/2005: Clemens Ballarin, TUM
563 Provers: tools for transitive relations and quasi orders.
564 Improved version of locales, notably interpretation of locales.
565 Improved version of HOL-Algebra.
567 * 2004/2005: Amine Chaieb, TUM
568 Improved version of HOL presburger method.
570 * 2004/2005: Steven Obua, TUM
571 Improved version of HOL/Import, support for HOL-Light.
572 Improved version of HOL-Complex-Matrix.
573 Pure/defs: more sophisticated checks on well-formedness of overloading.
574 Pure/Tools: an experimental evaluator for lambda terms.
576 * 2004/2005: Norbert Schirmer, TUM
577 Contributions to document 'sugar'.
578 Improved version of HOL/record.
580 * 2004/2005: Sebastian Skalberg, TUM
581 Improved version of HOL/Import.
582 Some internal ML reorganizations.
584 * 2004/2005: Tjark Weber, TUM
585 SAT solver method using zChaff.
586 Improved version of HOL/refute.