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 who is
3 listed as an author in one of the source files of this Isabelle distribution.
6 Contributions to Isabelle2021
7 -----------------------------
9 * January 2021: Manuel Eberl
10 Characteristic of a semiring.
12 * January 2021: Manuel Eberl
13 Algebraic integers in HOL-Computational_Algebra.
15 * December 2020: Stepan Holub
16 Contributed lemmas for theory HOL.List.
18 * December 2020: Martin Desharnais
19 Zipperposition 2.0 as external prover for Sledgehammer.
21 * December 2020: Walter Guttmann
22 Extension of session HOL-Hoare with total correctness proof system.
24 * November / December 2020: Makarius Wenzel
25 Improved HTML presentation and PDF document preparation, using mostly
26 Isabelle/Scala instead of Isabelle/ML.
28 * November 2020: Stepan Holub
29 Removed preconditions from lemma comm_append_are_replicate.
31 * November 2020: Florian Haftmann
32 Bundle mixins for locale and class expressions.
34 * November 2020: Jakub Kądziołka
35 Stronger lemmas about orders of group elements (generate_pow_card).
37 * October 2020: Jasmin Blanchette, Martin Desharnais, Mathias Fleury
38 Support veriT as external prover in Sledgehammer.
40 * October 2020: Mathias Fleury
41 Updated proof reconstruction for the SMT solver veriT in the smt method.
43 * October 2020: Jasmin Blanchette, Martin Desharnais
44 Support E prover 2.5 as external prover in Sledgehammer.
46 * September 2020: Florian Haftmann
47 Substantial reworking and modularization of Word library, with generic type
50 * August 2020: Makarius Wenzel
51 Finally enable PIDE protocol for batch-builds, with various consequences of
52 handling session build databases, Isabelle/Scala within Isabelle/ML etc.
54 * August 2020: Makarius Wenzel
55 Improved monitoring of runtime statistics: ML GC progress and Java.
57 * July 2020: Martin Desharnais
60 * June 2020: Makarius Wenzel
61 Batch-builds via "isabelle build" allow to invoke Scala from ML.
63 * June 2020: Florian Haftmann
64 Simproc defined_all for more aggressive substitution with variables
67 * May 2020: Makarius Wenzel
68 Antiquotations for Isabelle systems programming, notably @{scala_function}
69 and @{scala} to invoke Scala from ML.
71 * May 2020: Florian Haftmann
72 Generic algebraically founded bit operations NOT, AND, OR, XOR.
75 Contributions to Isabelle2020
76 -----------------------------
78 * February 2020: E. Gunther, M. Pagano and P. Sánchez Terraf
79 Simplified, generalised version of ZF/Constructible.
81 * January 2020: LC Paulson
82 The full finite Ramsey's theorem and elements of finite and infinite
85 * December 2019: Basil Fürer, Andreas Lochbihler, Joshua Schneider, Dmitriy
87 Extension of lift_bnf to support quotient types.
89 * November 2019: Peter Zeller, TU Kaiserslautern
90 Update of Isabelle/VSCode to WebviewPanel API.
92 * October..December 2019: Makarius Wenzel
93 Isabelle/Phabrictor server setup, including Linux platform support in
94 Isabelle/Scala. Client-side tool "isabelle hg_setup".
96 * October 2019: Maximilian Schäffeler
97 Port of the HOL Light decision procedure for metric spaces.
99 * October 2019: Makarius Wenzel
100 More scalable Isabelle dump and underlying headless PIDE session.
102 * August 2019: Makarius Wenzel
103 Better support for proof terms in Isabelle/Pure, notably via method
104 combinator SUBPROOFS (ML) and "subproofs" (Isar).
106 * July 2019: Alexander Krauss, Makarius Wenzel
107 Minimal support for a soft-type system within the Isabelle logical
111 Contributions to Isabelle2019
112 -----------------------------
114 * April 2019: LC Paulson
115 Homology and supporting lemmas on topology and group theory
117 * April 2019: Paulo de Vilhena and Martin Baillon
118 Group theory developments, esp. algebraic closure of a field
120 * February/March 2019: Makarius Wenzel
121 Stateless management of export artifacts in the Isabelle/HOL code generator.
123 * February 2019: Manuel Eberl
124 Exponentiation by squaring, used to implement "power" in monoid_mult and
125 fast modular exponentiation.
127 * February 2019: Manuel Eberl
128 Carmichael's function, primitive roots in residue rings, more properties of
129 the order in residue rings.
131 * February 2019: Jeremy Sylvestre
132 Formal Laurent Series and overhaul of Formal power series.
134 * January 2019: Florian Haftmann
135 Clarified syntax and congruence rules for big operators on sets involving
138 * January 2019: Florian Haftmann
139 Renovation of code generation, particularly export into session data and
140 proper strings and proper integers based on zarith for OCaml.
142 * January 2019: Andreas Lochbihler
143 New implementation for case_of_simps based on Code_Lazy's pattern matching
144 elimination algorithm.
146 * November/December 2018: Makarius Wenzel
147 Support for Isabelle/Haskell applications of Isabelle/PIDE.
149 * August/September 2018: Makarius Wenzel
150 Improvements of headless Isabelle/PIDE session and server, and systematic
151 exports from theory documents.
153 * December 2018: Florian Haftmann
154 Generic executable sorting algorithms based on executable comparators.
156 * October 2018: Mathias Fleury
157 Proof reconstruction for the SMT solver veriT in the smt method.
160 Contributions to Isabelle2018
161 -----------------------------
163 * July 2018: Manuel Eberl
164 "real_asymp" proof method for automatic proofs of real limits, "Big-O"
167 * June 2018: Fabian Immler
168 More tool support for HOL-Types_To_Sets.
170 * June 2018: Martin Baillon and Paulo Emílio de Vilhena
171 A variety of contributions to HOL-Algebra.
173 * June 2018: Wenda Li
174 New/strengthened results involving analysis, topology, etc.
176 * May/June 2018: Makarius Wenzel
177 System infrastructure to export blobs as theory presentation, and to dump
178 PIDE database content in batch mode.
180 * May 2018: Manuel Eberl
181 Landau symbols and asymptotic equivalence (moved from the AFP).
183 * May 2018: Jose Divasón (Universidad de la Rioja),
184 Jesús Aransay (Universidad de la Rioja), Johannes Hölzl (VU Amsterdam),
186 Generalizations in the formalization of linear algebra.
188 * May 2018: Florian Haftmann
189 Consolidation of string-like types in HOL.
191 * May 2018: Andreas Lochbihler (Digital Asset),
192 Pascal Stoop (ETH Zurich)
193 Code generation with lazy evaluation semantics.
195 * March 2018: Florian Haftmann
196 Abstract bit operations push_bit, take_bit, drop_bit, alongside with an
197 algebraic foundation for bit strings and word types in HOL-ex.
199 * March 2018: Viorel Preoteasa
200 Generalisation of complete_distrib_lattice
202 * February 2018: Wenda Li
203 A unified definition for the order of zeros and poles. Improved reasoning
204 around non-essential singularities.
206 * January 2018: Sebastien Gouezel
207 Various small additions to HOL-Analysis
209 * December 2017: Jan Gilcher, Andreas Lochbihler, Dmitriy Traytel
210 A new conditional parametricity prover.
212 * October 2017: Alexander Maletzky
213 Derivation of axiom "iff" in theory HOL.HOL from the other axioms.
216 Contributions to Isabelle2017
217 -----------------------------
219 * September 2017: Lawrence Paulson
220 HOL-Analysis, e.g. simplicial complexes, Jordan Curve Theorem.
222 * September 2017: Jasmin Blanchette
223 Further integration of Nunchaku model finder.
225 * November 2016 - June 2017: Makarius Wenzel
226 New Isabelle/VSCode, with underlying restructuring of Isabelle/PIDE.
228 * 2017: Makarius Wenzel
229 Session-qualified theory names (theory imports and ROOT files).
230 Prover IDE improvements.
231 Support for SQL databases in Isabelle/Scala: SQLite and PostgreSQL.
233 * August 2017: Andreas Lochbihler, ETH Zurich
234 type of unordered pairs (HOL-Library.Uprod)
236 * August 2017: Manuel Eberl, TUM
237 HOL-Analysis: infinite products over natural numbers,
238 infinite sums over arbitrary sets, connection between formal
239 power series and analytic complex functions
241 * March 2017: Alasdair Armstrong, University of Sheffield and
242 Simon Foster, University of York
243 Fixed-point theory and Galois Connections in HOL-Algebra.
245 * February 2017: Florian Haftmann, TUM
246 Statically embedded computations implemented by generated code.
249 Contributions to Isabelle2016-1
250 -------------------------------
252 * December 2016: Ondřej Kunčar, TUM
253 Types_To_Sets: experimental extension of Higher-Order Logic to allow
254 translation of types to sets.
256 * October 2016: Jasmin Blanchette
257 Integration of Nunchaku model finder.
259 * October 2016: Jaime Mendizabal Roche, TUM
260 Ported remaining theories of session Old_Number_Theory to the new
261 Number_Theory and removed Old_Number_Theory.
263 * September 2016: Sascha Boehme
264 Proof method "argo" based on SMT technology for a combination of
265 quantifier-free propositional logic, equality and linear real arithmetic
267 * July 2016: Daniel Stuewe
268 Height-size proofs in HOL-Data_Structures.
270 * July 2016: Manuel Eberl, TUM
271 Algebraic foundation for primes; generalization from nat to general
274 * June 2016: Andreas Lochbihler, ETH Zurich
275 Formalisation of discrete subprobability distributions.
277 * June 2016: Florian Haftmann, TUM
278 Improvements to code generation: optional timing measurements, more succint
279 closures for static evaluation, less ambiguities concering Scala implicits.
281 * May 2016: Manuel Eberl, TUM
282 Code generation for Probability Mass Functions.
284 * March 2016: Florian Haftmann, TUM
285 Abstract factorial rings with unique factorization.
287 * March 2016: Florian Haftmann, TUM
288 Reworking of the HOL char type as special case of a finite numeral type.
290 * March 2016: Andreas Lochbihler, ETH Zurich
291 Reasoning support for monotonicity, continuity and admissibility in
292 chain-complete partial orders.
294 * February - October 2016: Makarius Wenzel
295 Prover IDE improvements.
296 ML IDE improvements: bootstrap of Pure.
297 Isar language consolidation.
298 Notational modernization of HOL.
299 Tight Poly/ML integration.
300 More Isabelle/Scala system programming modules (e.g. SSH, Mercurial).
302 * Winter 2016: Jasmin Blanchette, Inria & LORIA & MPII, Aymeric Bouzy,
303 Ecole polytechnique, Andreas Lochbihler, ETH Zurich, Andrei Popescu,
304 Middlesex University, and Dmitriy Traytel, ETH Zurich
305 'corec' command and friends.
307 * January 2016: Florian Haftmann, TUM
308 Abolition of compound operators INFIMUM and SUPREMUM for complete lattices.
311 Contributions to Isabelle2016
312 -----------------------------
314 * Winter 2016: Manuel Eberl, TUM
315 Support for real exponentiation ("powr") in the "approximation" method.
316 (This was removed in Isabelle 2015 due to a changed definition of "powr".)
318 * Summer 2015 - Winter 2016: Lawrence C Paulson, Cambridge
319 General, homology form of Cauchy's integral theorem and supporting material
320 (ported from HOL Light).
322 * Winter 2015/16: Gerwin Klein, NICTA
323 New print_record command.
325 * May - December 2015: Makarius Wenzel
326 Prover IDE improvements.
327 More Isar language elements.
328 Document language refinements.
329 Poly/ML debugger integration.
330 Improved multi-platform and multi-architecture support.
332 * Winter 2015: Manuel Eberl, TUM
333 The radius of convergence of power series and various summability tests.
334 Harmonic numbers and the Euler-Mascheroni constant.
335 The Generalised Binomial Theorem.
336 The complex and real Gamma/log-Gamma/Digamma/Polygamma functions and their
337 most important properties.
339 * Autumn 2015: Manuel Eberl, TUM
340 Proper definition of division (with remainder) for formal power series;
341 Euclidean Ring and GCD instance for formal power series.
343 * Autumn 2015: Florian Haftmann, TUM
344 Rewrite definitions for global interpretations and sublocale declarations.
346 * Autumn 2015: Andreas Lochbihler
347 Bourbaki-Witt fixpoint theorem for increasing functions on chain-complete
350 * Autumn 2015: Chaitanya Mangla, Lawrence C Paulson, and Manuel Eberl
351 A large number of additional binomial identities.
353 * Summer 2015: Daniel Matichuk, NICTA and Makarius Wenzel
354 Isar subgoal command for proof structure within unstructured proof scripts.
356 * Summer 2015: Florian Haftmann, TUM
357 Generic partial division in rings as inverse operation of multiplication.
359 * Summer 2015: Manuel Eberl and Florian Haftmann, TUM
360 Type class hierarchy with common algebraic notions of integral (semi)domains
361 like units, associated elements and normalization wrt. units.
363 * Summer 2015: Florian Haftmann, TUM
364 Fundamentals of abstract type class for factorial rings.
366 * Summer 2015: Julian Biendarra, TUM and Dmitriy Traytel, ETH Zurich
367 Command to lift a BNF structure on the raw type to the abstract type for
370 * Summer 2014: Jeremy Avigad, Luke Serafin, CMU, and Johannes Hölzl, TUM
371 Proof of the central limit theorem: includes weak convergence,
372 characteristic functions, and Levy's uniqueness and continuity theorem.
375 Contributions to Isabelle2015
376 -----------------------------
378 * 2014/2015: Daniel Matichuk, Toby Murray, NICTA and Makarius Wenzel
379 The Eisbach proof method language and "match" method.
381 * Winter 2014 and Spring 2015: Ondrej Kuncar, TUM
382 Extension of lift_definition to execute lifted functions that have as a
383 return type a datatype containing a subtype.
385 * March 2015: Jasmin Blanchette, Inria & LORIA & MPII, Mathias Fleury, MPII,
386 and Dmitriy Traytel, TUM
387 More multiset theorems, syntax, and operations.
389 * December 2014: Johannes Hölzl, Manuel Eberl, Sudeep Kanav, TUM, and
390 Jeremy Avigad, Luke Serafin, CMU
391 Various integration theorems: mostly integration on intervals and
394 * September 2014: Florian Haftmann, TUM
395 Lexicographic order on functions and
396 sum/product over function bodies.
398 * August 2014: Andreas Lochbihler, ETH Zurich
399 Test infrastructure for executing generated code in target languages.
401 * August 2014: Manuel Eberl, TUM
402 Generic euclidean algorithms for GCD et al.
405 Contributions to Isabelle2014
406 -----------------------------
408 * July 2014: Thomas Sewell, NICTA
409 Preserve equality hypotheses in "clarify" and friends. New
410 "hypsubst_thin" method configuration option.
412 * Summer 2014: Florian Haftmann, TUM
413 Consolidation and generalization of facts concerning (abelian)
414 semigroups and monoids, particularly products (resp. sums) on
417 * Summer 2014: Mathias Fleury, ENS Rennes, and Albert Steckermeier, TUM
418 Work on exotic automatic theorem provers for Sledgehammer (LEO-II,
419 veriT, Waldmeister, etc.).
421 * June 2014: Florian Haftmann, TUM
422 Internal reorganisation of the local theory / named target stack.
424 * June 2014: Sudeep Kanav, TUM, Jeremy Avigad, CMU, and Johannes Hölzl, TUM
425 Various properties of exponentially, Erlang, and normal distributed
428 * May 2014: Cezary Kaliszyk, University of Innsbruck, and
429 Jasmin Blanchette, TUM
430 SML-based engines for MaSh.
432 * March 2014: René Thiemann
433 Improved code generation for multisets.
435 * February 2014: Florian Haftmann, TUM
436 Permanent interpretation inside theory, locale and class targets
437 with mixin definitions.
439 * Spring 2014: Lawrence C Paulson, Cambridge
440 Theory Complex_Basic_Analysis. Tidying up Number_Theory vs Old_Number_Theory
442 * Winter 2013 and Spring 2014: Ondrej Kuncar, TUM
443 Various improvements to Lifting/Transfer, integration with the BNF package.
445 * Winter 2013 and Spring 2014: Makarius Wenzel, Université Paris-Sud / LRI
446 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
448 * Fall 2013 and Winter 2014: Martin Desharnais, Lorenz Panny,
449 Dmitriy Traytel, and Jasmin Blanchette, TUM
450 Various improvements to the BNF-based (co)datatype package,
451 including a more polished "primcorec" command, optimizations, and
452 integration in the "HOL" session.
454 * Winter/Spring 2014: Sascha Boehme, QAware GmbH, and
455 Jasmin Blanchette, TUM
456 "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and
459 * January 2014: Lars Hupel, TUM
460 An improved, interactive simplifier trace with integration into the
461 Isabelle/jEdit Prover IDE.
463 * December 2013: Florian Haftmann, TUM
464 Consolidation of abstract interpretations concerning min and max.
466 * November 2013: Florian Haftmann, TUM
467 Abolition of negative numeral literals in the logic.
470 Contributions to Isabelle2013-1
471 -------------------------------
473 * September 2013: Lars Noschinski, TUM
474 Conversion between function definitions as list of equations and
475 case expressions in HOL.
476 New library Simps_Case_Conv with commands case_of_simps,
479 * September 2013: Nik Sultana, University of Cambridge
480 Improvements to HOL/TPTP parser and import facilities.
482 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
483 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
485 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
486 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
488 * Summer 2013: Manuel Eberl, TUM
489 Generation of elimination rules in the function package.
490 New command "fun_cases".
492 * Summer 2013: Christian Sternagel, JAIST
493 Improved support for ad hoc overloading of constants, including
494 documentation and examples.
496 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
497 Jasmin Blanchette, TUM
498 Various improvements to the BNF-based (co)datatype package, including
499 "primrec_new" and "primcorec" commands and a compatibility layer.
501 * Spring and Summer 2013: Ondrej Kuncar, TUM
502 Various improvements of Lifting and Transfer packages.
504 * Spring 2013: Brian Huffman, Galois Inc.
505 Improvements of the Transfer package.
507 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
508 Jasmin Blanchette, TUM
509 Various improvements to MaSh, including a server mode.
511 * First half of 2013: Steffen Smolka, TUM
512 Further improvements to Sledgehammer's Isar proof generator.
514 * May 2013: Florian Haftmann, TUM
515 Ephemeral interpretation in local theories.
517 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
518 Spec_Check: A Quickcheck tool for Isabelle/ML.
520 * April 2013: Stefan Berghofer, secunet Security Networks AG
522 Makarius Wenzel, Université Paris-Sud / LRI
523 Case translations as a separate check phase independent of the
526 * March 2013: Florian Haftmann, TUM
527 Reform of "big operators" on sets.
529 * March 2013: Florian Haftmann, TUM
530 Algebraic locale hierarchy for orderings and (semi)lattices.
532 * February 2013: Florian Haftmann, TUM
533 Reworking and consolidation of code generation for target language
536 * February 2013: Florian Haftmann, TUM
537 Sieve of Eratosthenes.
540 Contributions to Isabelle2013
541 -----------------------------
543 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
544 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
546 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
547 Jasmin Blanchette, TUM
548 Implemented Machine Learning for Sledgehammer (MaSh).
550 * Fall 2012: Steffen Smolka, TUM
551 Various improvements to Sledgehammer's Isar proof generator,
552 including a smart type annotation algorithm and proof shrinking.
554 * December 2012: Alessandro Coglio, Kestrel
555 Contributions to HOL's Lattice library.
557 * November 2012: Fabian Immler, TUM
558 "Symbols" dockable for Isabelle/jEdit.
560 * November 2012: Fabian Immler, TUM
561 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
562 of projective families.
564 * October 2012: Andreas Lochbihler, KIT
565 Efficient construction of red-black trees from sorted associative
568 * September 2012: Florian Haftmann, TUM
569 Lattice instances for type option.
571 * September 2012: Christian Sternagel, JAIST
572 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
573 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
575 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
576 New BNF-based (co)datatype package.
578 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
579 Theories of ordinals and cardinals.
581 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
582 Advanced support for Isabelle sessions and build management, notably
585 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
586 Simproc for rewriting set comprehensions into pointfree expressions.
588 * May 2012: Andreas Lochbihler, KIT
589 Theory of almost everywhere constant functions.
591 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
592 Graphview in Scala/Swing.
595 Contributions to Isabelle2012
596 -----------------------------
598 * April 2012: Johannes Hölzl, TUM
599 Probability: Introduced type to represent measures instead of
602 * April 2012: Johannes Hölzl, Fabian Immler, TUM
603 Float: Moved to Dyadic rationals to represent floating point numers.
605 * April 2012: Thomas Sewell, NICTA and
606 2010: Sascha Boehme, TUM
607 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
608 equalities/inequalities.
610 * March 2012: Christian Sternagel, JAIST
611 Consolidated theory of relation composition.
613 * March 2012: Nik Sultana, University of Cambridge
614 HOL/TPTP parser and import facilities.
616 * March 2012: Cezary Kaliszyk, University of Innsbruck and
617 Alexander Krauss, QAware GmbH
618 Faster and more scalable Import mechanism for HOL Light proofs.
620 * January 2012: Florian Haftmann, TUM, et al.
621 (Re-)Introduction of the "set" type constructor.
623 * 2012: Ondrej Kuncar, TUM
624 New package Lifting, various improvements and refinements to the
627 * 2011/2012: Jasmin Blanchette, TUM
628 Various improvements to Sledgehammer, notably: tighter integration
629 with SPASS, support for more provers (Alt-Ergo, iProver,
632 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
633 Various refinements of local theory infrastructure.
634 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
637 Contributions to Isabelle2011-1
638 -------------------------------
640 * September 2011: Peter Gammie
641 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
643 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
644 Refined theory on complete lattices.
646 * August 2011: Brian Huffman, Portland State University
647 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
649 * June 2011: Brian Huffman, Portland State University
650 Proof method "countable_datatype" for theory Library/Countable.
652 * 2011: Jasmin Blanchette, TUM
653 Various improvements to Sledgehammer, notably: use of sound
654 translations, support for more provers (Waldmeister, LEO-II,
655 Satallax). Further development of Nitpick and 'try' command.
657 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
658 Theory HOL/Library/Cset_Monad allows do notation for computable sets
659 (cset) via the generic monad ad-hoc overloading facility.
661 * 2011: Johannes Hölzl, Armin Heller, TUM and
662 Bogdan Grechuk, University of Edinburgh
663 Theory HOL/Library/Extended_Reals: real numbers extended with plus
666 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
667 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
671 Contributions to Isabelle2011
672 -----------------------------
674 * January 2011: Stefan Berghofer, secunet Security Networks AG
675 HOL-SPARK: an interactive prover back-end for SPARK.
677 * October 2010: Bogdan Grechuk, University of Edinburgh
678 Extended convex analysis in Multivariate Analysis.
680 * October 2010: Dmitriy Traytel, TUM
681 Coercive subtyping via subtype constraints.
683 * October 2010: Alexander Krauss, TUM
684 Command partial_function for function definitions based on complete
685 partial orders in HOL.
687 * September 2010: Florian Haftmann, TUM
688 Refined concepts for evaluation, i.e., normalization of terms using
689 different techniques.
691 * September 2010: Florian Haftmann, TUM
692 Code generation for Scala.
694 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
695 Improved Probability theory in HOL.
697 * July 2010: Florian Haftmann, TUM
698 Reworking and extension of the Imperative HOL framework.
700 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
702 Ad-hoc overloading. Generic do notation for monads.
705 Contributions to Isabelle2009-2
706 -------------------------------
708 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
709 Makarius Wenzel, TUM / LRI
710 Elimination of type classes from proof terms.
712 * April 2010: Florian Haftmann, TUM
713 Reorganization of abstract algebra type classes.
715 * April 2010: Florian Haftmann, TUM
716 Code generation for data representations involving invariants;
717 various collections avaiable in theories Fset, Dlist, RBT,
718 Mapping and AssocList.
720 * March 2010: Sascha Boehme, TUM
721 Efficient SHA1 library for Poly/ML.
723 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
724 Quotient type package for Isabelle/HOL.
727 Contributions to Isabelle2009-1
728 -------------------------------
730 * November 2009, Brian Huffman, PSU
731 New definitional domain package for HOLCF.
733 * November 2009: Robert Himmelmann, TUM
734 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
736 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
737 A tabled implementation of the reflexive transitive closure.
739 * November 2009: Lukas Bulwahn, TUM
740 Predicate Compiler: a compiler for inductive predicates to
741 equational specifications.
743 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
744 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
746 * October 2009: Jasmin Blanchette, TUM
747 Nitpick: yet another counterexample generator for Isabelle/HOL.
749 * October 2009: Sascha Boehme, TUM
750 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
752 * October 2009: Florian Haftmann, TUM
753 Refinement of parts of the HOL datatype package.
755 * October 2009: Florian Haftmann, TUM
756 Generic term styles for term antiquotations.
758 * September 2009: Thomas Sewell, NICTA
759 More efficient HOL/record implementation.
761 * September 2009: Sascha Boehme, TUM
762 SMT method using external SMT solvers.
764 * September 2009: Florian Haftmann, TUM
765 Refinement of sets and lattices.
767 * July 2009: Jeremy Avigad and Amine Chaieb
770 * July 2009: Philipp Meyer, TUM
771 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
774 * July 2009: Florian Haftmann, TUM
775 New quickcheck implementation using new code generator.
777 * July 2009: Florian Haftmann, TUM
778 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
781 * June 2009: Florian Haftmann, TUM
782 HOL/Library/Tree: search trees implementing mappings, ready to use
785 * March 2009: Philipp Meyer, TUM
786 Minimization tool for results from Sledgehammer.
789 Contributions to Isabelle2009
790 -----------------------------
792 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
794 Elementary topology in Euclidean space.
796 * March 2009: Johannes Hoelzl, TUM
797 Method "approximation", which proves real valued inequalities by
800 * February 2009: Filip Maric, Univ. of Belgrade
803 * February 2009: Jasmin Christian Blanchette, TUM
804 Misc cleanup of HOL/refute.
806 * February 2009: Timothy Bourke, NICTA
807 New find_consts command.
809 * February 2009: Timothy Bourke, NICTA
810 "solves" criterion for find_theorems and auto_solve option
812 * December 2008: Clemens Ballarin, TUM
813 New locale implementation.
815 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
816 Method "sizechange" for advanced termination proofs.
818 * November 2008: Timothy Bourke, NICTA
819 Performance improvement (factor 50) for find_theorems.
821 * 2008: Florian Haftmann, TUM
822 Various extensions and restructurings in HOL, improvements
823 in evaluation mechanisms, new module binding.ML for name bindings.
825 * October 2008: Fabian Immler, TUM
826 ATP manager for Sledgehammer, based on ML threads instead of Posix
827 processes. Additional ATP wrappers, including remote SystemOnTPTP
830 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
831 Prover for coherent logic.
833 * August 2008: Fabian Immler, TUM
834 Vampire wrapper script for remote SystemOnTPTP service.
837 Contributions to Isabelle2008
838 -----------------------------
841 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
842 HOL library improvements.
844 * 2007/2008: Brian Huffman, PSU
845 HOLCF library improvements.
847 * 2007/2008: Stefan Berghofer, TUM
848 HOL-Nominal package improvements.
850 * March 2008: Markus Reiter, TUM
851 HOL/Library/RBT: red-black trees.
853 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
854 Lukas Bulwahn, TUM and John Matthews, Galois:
855 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
858 * December 2007: Norbert Schirmer, Uni Saarbruecken
859 Misc improvements of record package in HOL.
861 * December 2007: Florian Haftmann, TUM
862 Overloading and class instantiation target.
864 * December 2007: Florian Haftmann, TUM
865 New version of primrec package for local theories.
867 * December 2007: Alexander Krauss, TUM
868 Method "induction_scheme" in HOL.
870 * November 2007: Peter Lammich, Uni Muenster
871 HOL-Lattice: some more lemmas.
874 Contributions to Isabelle2007
875 -----------------------------
877 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
878 State Spaces: The Locale Way (in HOL).
880 * October 2007: Mark A. Hillebrand, DFKI
881 Robust sub/superscripts in LaTeX document output.
883 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
884 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
885 HOL-Word: a library for fixed-size machine words in Isabelle.
887 * August 2007: Brian Huffman, PSU
888 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
890 * June 2007: Amine Chaieb, TUM
891 Semiring normalization and Groebner Bases.
892 Support for dense linear orders.
894 * June 2007: Joe Hurd, Oxford
895 Metis theorem-prover.
897 * 2007: Kong W. Susanto, Cambridge
898 HOL: Metis prover integration.
900 * 2007: Stefan Berghofer, TUM
901 HOL: inductive predicates and sets.
903 * 2007: Norbert Schirmer, TUM
904 HOL/record: misc improvements.
906 * 2006/2007: Alexander Krauss, TUM
907 HOL: function package and related theories on termination.
909 * 2006/2007: Florian Haftmann, TUM
910 Pure: generic code generator framework.
912 HOL: theory reorganization, code generator setup.
914 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
916 HOL/Nominal package and related tools.
918 * November 2006: Lukas Bulwahn, TUM
919 HOL: method "lexicographic_order" for function package.
921 * October 2006: Stefan Hohe, TUM
922 HOL-Algebra: ideals and quotients over rings.
924 * August 2006: Amine Chaieb, TUM
925 Experimental support for generic reflection and reification in HOL.
927 * July 2006: Rafal Kolanski, NICTA
928 Hex (0xFF) and binary (0b1011) numerals.
930 * May 2006: Klaus Aehlig, LMU
931 Command 'normal_form': normalization by evaluation.
933 * May 2006: Amine Chaieb, TUM
934 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
937 * February 2006: Benjamin Porter, NICTA
938 HOL and HOL-Complex: generalised mean value theorem, continuum is
939 not denumerable, harmonic and arithmetic series, and denumerability
942 * October 2005: Martin Wildmoser, TUM
943 Sketch for Isar 'guess' element.
946 Contributions to Isabelle2005
947 -----------------------------
949 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
950 HOL-Complex: Formalization of Taylor series.
952 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
953 Components for SAT solver method using zChaff.
955 * September 2005: Ning Zhang and Christian Urban, LMU Munich
958 * September 2005: Bernhard Haeupler, TUM
959 Method comm_ring for proving equalities in commutative rings.
961 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
962 Various improvements of the HOL and HOL-Complex library.
964 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
965 Some structured proofs about completeness of real numbers.
967 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
968 Improved retrieval of facts from theory/proof context.
970 * February 2005: Lucas Dixon, University of Edinburgh
971 Improved subst method.
973 * 2005: Brian Huffman, OGI
974 Various improvements of HOLCF.
975 Some improvements of the HOL-Complex library.
977 * 2005: Claire Quigley and Jia Meng, University of Cambridge
978 Some support for asynchronous communication with external provers
981 * 2005: Florian Haftmann, TUM
982 Contributions to document 'sugar'.
983 Various ML combinators, notably linear functional transformations.
984 Some cleanup of ML legacy.
985 Additional antiquotations.
986 Improved Isabelle web site.
988 * 2004/2005: David Aspinall, University of Edinburgh
989 Various elements of XML and PGIP based communication with user
990 interfaces (experimental).
992 * 2004/2005: Gerwin Klein, NICTA
993 Contributions to document 'sugar'.
994 Improved Isabelle web site.
995 Improved HTML presentation of theories.
997 * 2004/2005: Clemens Ballarin, TUM
998 Provers: tools for transitive relations and quasi orders.
999 Improved version of locales, notably interpretation of locales.
1000 Improved version of HOL-Algebra.
1002 * 2004/2005: Amine Chaieb, TUM
1003 Improved version of HOL presburger method.
1005 * 2004/2005: Steven Obua, TUM
1006 Improved version of HOL/Import, support for HOL-Light.
1007 Improved version of HOL-Complex-Matrix.
1008 Pure/defs: more sophisticated checks on well-formedness of overloading.
1009 Pure/Tools: an experimental evaluator for lambda terms.
1011 * 2004/2005: Norbert Schirmer, TUM
1012 Contributions to document 'sugar'.
1013 Improved version of HOL/record.
1015 * 2004/2005: Sebastian Skalberg, TUM
1016 Improved version of HOL/Import.
1017 Some internal ML reorganizations.
1019 * 2004/2005: Tjark Weber, TUM
1020 SAT solver method using zChaff.
1021 Improved version of HOL/refute.