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 Isabelle2017
7 -----------------------------
9 * September 2017: Lawrence Paulson
10 HOL-Analysis, e.g. simplicial complexes, Jordan Curve Theorem.
12 * September 2017: Jasmin Blanchette
13 Further integration of Nunchaku model finder.
15 * November 2016 - June 2017: Makarius Wenzel
16 New Isabelle/VSCode, with underlying restructuring of Isabelle/PIDE.
18 * 2017: Makarius Wenzel
19 Session-qualified theory names (theory imports and ROOT files).
20 Prover IDE improvements.
21 Support for SQL databases in Isabelle/Scala: SQLite and PostgreSQL.
23 * August 2017: Andreas Lochbihler, ETH Zurich
24 type of unordered pairs (HOL-Library.Uprod)
26 * August 2017: Manuel Eberl, TUM
27 HOL-Analysis: infinite products over natural numbers,
28 infinite sums over arbitrary sets, connection between formal
29 power series and analytic complex functions
31 * March 2017: Alasdair Armstrong, University of Sheffield and
32 Simon Foster, University of York
33 Fixed-point theory and Galois Connections in HOL-Algebra.
35 * February 2017: Florian Haftmann, TUM
36 Statically embedded computations implemented by generated code.
39 Contributions to Isabelle2016-1
40 -------------------------------
42 * December 2016: Ondřej Kunčar, TUM
43 Types_To_Sets: experimental extension of Higher-Order Logic to allow
44 translation of types to sets.
46 * October 2016: Jasmin Blanchette
47 Integration of Nunchaku model finder.
49 * October 2016: Jaime Mendizabal Roche, TUM
50 Ported remaining theories of session Old_Number_Theory to the new
51 Number_Theory and removed Old_Number_Theory.
53 * September 2016: Sascha Boehme
54 Proof method "argo" based on SMT technology for a combination of
55 quantifier-free propositional logic, equality and linear real arithmetic
57 * July 2016: Daniel Stuewe
58 Height-size proofs in HOL-Data_Structures.
60 * July 2016: Manuel Eberl, TUM
61 Algebraic foundation for primes; generalization from nat to general
64 * June 2016: Andreas Lochbihler, ETH Zurich
65 Formalisation of discrete subprobability distributions.
67 * June 2016: Florian Haftmann, TUM
68 Improvements to code generation: optional timing measurements, more succint
69 closures for static evaluation, less ambiguities concering Scala implicits.
71 * May 2016: Manuel Eberl, TUM
72 Code generation for Probability Mass Functions.
74 * March 2016: Florian Haftmann, TUM
75 Abstract factorial rings with unique factorization.
77 * March 2016: Florian Haftmann, TUM
78 Reworking of the HOL char type as special case of a finite numeral type.
80 * March 2016: Andreas Lochbihler, ETH Zurich
81 Reasoning support for monotonicity, continuity and admissibility in
82 chain-complete partial orders.
84 * February - October 2016: Makarius Wenzel
85 Prover IDE improvements.
86 ML IDE improvements: bootstrap of Pure.
87 Isar language consolidation.
88 Notational modernization of HOL.
89 Tight Poly/ML integration.
90 More Isabelle/Scala system programming modules (e.g. SSH, Mercurial).
92 * Winter 2016: Jasmin Blanchette, Inria & LORIA & MPII, Aymeric Bouzy,
93 Ecole polytechnique, Andreas Lochbihler, ETH Zurich, Andrei Popescu,
94 Middlesex University, and Dmitriy Traytel, ETH Zurich
95 'corec' command and friends.
97 * January 2016: Florian Haftmann, TUM
98 Abolition of compound operators INFIMUM and SUPREMUM for complete lattices.
101 Contributions to Isabelle2016
102 -----------------------------
104 * Winter 2016: Manuel Eberl, TUM
105 Support for real exponentiation ("powr") in the "approximation" method.
106 (This was removed in Isabelle 2015 due to a changed definition of "powr".)
108 * Summer 2015 - Winter 2016: Lawrence C Paulson, Cambridge
109 General, homology form of Cauchy's integral theorem and supporting material
110 (ported from HOL Light).
112 * Winter 2015/16: Gerwin Klein, NICTA
113 New print_record command.
115 * May - December 2015: Makarius Wenzel
116 Prover IDE improvements.
117 More Isar language elements.
118 Document language refinements.
119 Poly/ML debugger integration.
120 Improved multi-platform and multi-architecture support.
122 * Winter 2015: Manuel Eberl, TUM
123 The radius of convergence of power series and various summability tests.
124 Harmonic numbers and the Euler-Mascheroni constant.
125 The Generalised Binomial Theorem.
126 The complex and real Gamma/log-Gamma/Digamma/Polygamma functions and their
127 most important properties.
129 * Autumn 2015: Manuel Eberl, TUM
130 Proper definition of division (with remainder) for formal power series;
131 Euclidean Ring and GCD instance for formal power series.
133 * Autumn 2015: Florian Haftmann, TUM
134 Rewrite definitions for global interpretations and sublocale declarations.
136 * Autumn 2015: Andreas Lochbihler
137 Bourbaki-Witt fixpoint theorem for increasing functions on chain-complete
140 * Autumn 2015: Chaitanya Mangla, Lawrence C Paulson, and Manuel Eberl
141 A large number of additional binomial identities.
143 * Summer 2015: Daniel Matichuk, NICTA and Makarius Wenzel
144 Isar subgoal command for proof structure within unstructured proof scripts.
146 * Summer 2015: Florian Haftmann, TUM
147 Generic partial division in rings as inverse operation of multiplication.
149 * Summer 2015: Manuel Eberl and Florian Haftmann, TUM
150 Type class hierarchy with common algebraic notions of integral (semi)domains
151 like units, associated elements and normalization wrt. units.
153 * Summer 2015: Florian Haftmann, TUM
154 Fundamentals of abstract type class for factorial rings.
156 * Summer 2015: Julian Biendarra, TUM and Dmitriy Traytel, ETH Zurich
157 Command to lift a BNF structure on the raw type to the abstract type for
160 * Summer 2014: Jeremy Avigad, Luke Serafin, CMU, and Johannes Hölzl, TUM
161 Proof of the central limit theorem: includes weak convergence,
162 characteristic functions, and Levy's uniqueness and continuity theorem.
165 Contributions to Isabelle2015
166 -----------------------------
168 * 2014/2015: Daniel Matichuk, Toby Murray, NICTA and Makarius Wenzel
169 The Eisbach proof method language and "match" method.
171 * Winter 2014 and Spring 2015: Ondrej Kuncar, TUM
172 Extension of lift_definition to execute lifted functions that have as a
173 return type a datatype containing a subtype.
175 * March 2015: Jasmin Blanchette, Inria & LORIA & MPII, Mathias Fleury, MPII,
176 and Dmitriy Traytel, TUM
177 More multiset theorems, syntax, and operations.
179 * December 2014: Johannes Hölzl, Manuel Eberl, Sudeep Kanav, TUM, and
180 Jeremy Avigad, Luke Serafin, CMU
181 Various integration theorems: mostly integration on intervals and
184 * September 2014: Florian Haftmann, TUM
185 Lexicographic order on functions and
186 sum/product over function bodies.
188 * August 2014: Andreas Lochbihler, ETH Zurich
189 Test infrastructure for executing generated code in target languages.
191 * August 2014: Manuel Eberl, TUM
192 Generic euclidean algorithms for GCD et al.
195 Contributions to Isabelle2014
196 -----------------------------
198 * July 2014: Thomas Sewell, NICTA
199 Preserve equality hypotheses in "clarify" and friends. New
200 "hypsubst_thin" method configuration option.
202 * Summer 2014: Florian Haftmann, TUM
203 Consolidation and generalization of facts concerning (abelian)
204 semigroups and monoids, particularly products (resp. sums) on
207 * Summer 2014: Mathias Fleury, ENS Rennes, and Albert Steckermeier, TUM
208 Work on exotic automatic theorem provers for Sledgehammer (LEO-II,
209 veriT, Waldmeister, etc.).
211 * June 2014: Florian Haftmann, TUM
212 Internal reorganisation of the local theory / named target stack.
214 * June 2014: Sudeep Kanav, TUM, Jeremy Avigad, CMU, and Johannes Hölzl, TUM
215 Various properties of exponentially, Erlang, and normal distributed
218 * May 2014: Cezary Kaliszyk, University of Innsbruck, and
219 Jasmin Blanchette, TUM
220 SML-based engines for MaSh.
222 * March 2014: René Thiemann
223 Improved code generation for multisets.
225 * February 2014: Florian Haftmann, TUM
226 Permanent interpretation inside theory, locale and class targets
227 with mixin definitions.
229 * Spring 2014: Lawrence C Paulson, Cambridge
230 Theory Complex_Basic_Analysis. Tidying up Number_Theory vs Old_Number_Theory
232 * Winter 2013 and Spring 2014: Ondrej Kuncar, TUM
233 Various improvements to Lifting/Transfer, integration with the BNF package.
235 * Winter 2013 and Spring 2014: Makarius Wenzel, Université Paris-Sud / LRI
236 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
238 * Fall 2013 and Winter 2014: Martin Desharnais, Lorenz Panny,
239 Dmitriy Traytel, and Jasmin Blanchette, TUM
240 Various improvements to the BNF-based (co)datatype package,
241 including a more polished "primcorec" command, optimizations, and
242 integration in the "HOL" session.
244 * Winter/Spring 2014: Sascha Boehme, QAware GmbH, and
245 Jasmin Blanchette, TUM
246 "SMT2" module and "smt2" proof method, based on SMT-LIB 2 and
249 * January 2014: Lars Hupel, TUM
250 An improved, interactive simplifier trace with integration into the
251 Isabelle/jEdit Prover IDE.
253 * December 2013: Florian Haftmann, TUM
254 Consolidation of abstract interpretations concerning min and max.
256 * November 2013: Florian Haftmann, TUM
257 Abolition of negative numeral literals in the logic.
260 Contributions to Isabelle2013-1
261 -------------------------------
263 * September 2013: Lars Noschinski, TUM
264 Conversion between function definitions as list of equations and
265 case expressions in HOL.
266 New library Simps_Case_Conv with commands case_of_simps,
269 * September 2013: Nik Sultana, University of Cambridge
270 Improvements to HOL/TPTP parser and import facilities.
272 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
273 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
275 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
276 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
278 * Summer 2013: Manuel Eberl, TUM
279 Generation of elimination rules in the function package.
280 New command "fun_cases".
282 * Summer 2013: Christian Sternagel, JAIST
283 Improved support for ad hoc overloading of constants, including
284 documentation and examples.
286 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
287 Jasmin Blanchette, TUM
288 Various improvements to the BNF-based (co)datatype package, including
289 "primrec_new" and "primcorec" commands and a compatibility layer.
291 * Spring and Summer 2013: Ondrej Kuncar, TUM
292 Various improvements of Lifting and Transfer packages.
294 * Spring 2013: Brian Huffman, Galois Inc.
295 Improvements of the Transfer package.
297 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
298 Jasmin Blanchette, TUM
299 Various improvements to MaSh, including a server mode.
301 * First half of 2013: Steffen Smolka, TUM
302 Further improvements to Sledgehammer's Isar proof generator.
304 * May 2013: Florian Haftmann, TUM
305 Ephemeral interpretation in local theories.
307 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
308 Spec_Check: A Quickcheck tool for Isabelle/ML.
310 * April 2013: Stefan Berghofer, secunet Security Networks AG
312 Makarius Wenzel, Université Paris-Sud / LRI
313 Case translations as a separate check phase independent of the
316 * March 2013: Florian Haftmann, TUM
317 Reform of "big operators" on sets.
319 * March 2013: Florian Haftmann, TUM
320 Algebraic locale hierarchy for orderings and (semi)lattices.
322 * February 2013: Florian Haftmann, TUM
323 Reworking and consolidation of code generation for target language
326 * February 2013: Florian Haftmann, TUM
327 Sieve of Eratosthenes.
330 Contributions to Isabelle2013
331 -----------------------------
333 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
334 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
336 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
337 Jasmin Blanchette, TUM
338 Implemented Machine Learning for Sledgehammer (MaSh).
340 * Fall 2012: Steffen Smolka, TUM
341 Various improvements to Sledgehammer's Isar proof generator,
342 including a smart type annotation algorithm and proof shrinking.
344 * December 2012: Alessandro Coglio, Kestrel
345 Contributions to HOL's Lattice library.
347 * November 2012: Fabian Immler, TUM
348 "Symbols" dockable for Isabelle/jEdit.
350 * November 2012: Fabian Immler, TUM
351 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
352 of projective families.
354 * October 2012: Andreas Lochbihler, KIT
355 Efficient construction of red-black trees from sorted associative
358 * September 2012: Florian Haftmann, TUM
359 Lattice instances for type option.
361 * September 2012: Christian Sternagel, JAIST
362 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
363 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
365 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
366 New BNF-based (co)datatype package.
368 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
369 Theories of ordinals and cardinals.
371 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
372 Advanced support for Isabelle sessions and build management, notably
375 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
376 Simproc for rewriting set comprehensions into pointfree expressions.
378 * May 2012: Andreas Lochbihler, KIT
379 Theory of almost everywhere constant functions.
381 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
382 Graphview in Scala/Swing.
385 Contributions to Isabelle2012
386 -----------------------------
388 * April 2012: Johannes Hölzl, TUM
389 Probability: Introduced type to represent measures instead of
392 * April 2012: Johannes Hölzl, Fabian Immler, TUM
393 Float: Moved to Dyadic rationals to represent floating point numers.
395 * April 2012: Thomas Sewell, NICTA and
396 2010: Sascha Boehme, TUM
397 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
398 equalities/inequalities.
400 * March 2012: Christian Sternagel, JAIST
401 Consolidated theory of relation composition.
403 * March 2012: Nik Sultana, University of Cambridge
404 HOL/TPTP parser and import facilities.
406 * March 2012: Cezary Kaliszyk, University of Innsbruck and
407 Alexander Krauss, QAware GmbH
408 Faster and more scalable Import mechanism for HOL Light proofs.
410 * January 2012: Florian Haftmann, TUM, et al.
411 (Re-)Introduction of the "set" type constructor.
413 * 2012: Ondrej Kuncar, TUM
414 New package Lifting, various improvements and refinements to the
417 * 2011/2012: Jasmin Blanchette, TUM
418 Various improvements to Sledgehammer, notably: tighter integration
419 with SPASS, support for more provers (Alt-Ergo, iProver,
422 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
423 Various refinements of local theory infrastructure.
424 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
427 Contributions to Isabelle2011-1
428 -------------------------------
430 * September 2011: Peter Gammie
431 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
433 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
434 Refined theory on complete lattices.
436 * August 2011: Brian Huffman, Portland State University
437 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
439 * June 2011: Brian Huffman, Portland State University
440 Proof method "countable_datatype" for theory Library/Countable.
442 * 2011: Jasmin Blanchette, TUM
443 Various improvements to Sledgehammer, notably: use of sound
444 translations, support for more provers (Waldmeister, LEO-II,
445 Satallax). Further development of Nitpick and 'try' command.
447 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
448 Theory HOL/Library/Cset_Monad allows do notation for computable sets
449 (cset) via the generic monad ad-hoc overloading facility.
451 * 2011: Johannes Hölzl, Armin Heller, TUM and
452 Bogdan Grechuk, University of Edinburgh
453 Theory HOL/Library/Extended_Reals: real numbers extended with plus
456 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
457 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
461 Contributions to Isabelle2011
462 -----------------------------
464 * January 2011: Stefan Berghofer, secunet Security Networks AG
465 HOL-SPARK: an interactive prover back-end for SPARK.
467 * October 2010: Bogdan Grechuk, University of Edinburgh
468 Extended convex analysis in Multivariate Analysis.
470 * October 2010: Dmitriy Traytel, TUM
471 Coercive subtyping via subtype constraints.
473 * October 2010: Alexander Krauss, TUM
474 Command partial_function for function definitions based on complete
475 partial orders in HOL.
477 * September 2010: Florian Haftmann, TUM
478 Refined concepts for evaluation, i.e., normalization of terms using
479 different techniques.
481 * September 2010: Florian Haftmann, TUM
482 Code generation for Scala.
484 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
485 Improved Probability theory in HOL.
487 * July 2010: Florian Haftmann, TUM
488 Reworking and extension of the Imperative HOL framework.
490 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
492 Ad-hoc overloading. Generic do notation for monads.
495 Contributions to Isabelle2009-2
496 -------------------------------
498 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
499 Makarius Wenzel, TUM / LRI
500 Elimination of type classes from proof terms.
502 * April 2010: Florian Haftmann, TUM
503 Reorganization of abstract algebra type classes.
505 * April 2010: Florian Haftmann, TUM
506 Code generation for data representations involving invariants;
507 various collections avaiable in theories Fset, Dlist, RBT,
508 Mapping and AssocList.
510 * March 2010: Sascha Boehme, TUM
511 Efficient SHA1 library for Poly/ML.
513 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
514 Quotient type package for Isabelle/HOL.
517 Contributions to Isabelle2009-1
518 -------------------------------
520 * November 2009, Brian Huffman, PSU
521 New definitional domain package for HOLCF.
523 * November 2009: Robert Himmelmann, TUM
524 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
526 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
527 A tabled implementation of the reflexive transitive closure.
529 * November 2009: Lukas Bulwahn, TUM
530 Predicate Compiler: a compiler for inductive predicates to
531 equational specifications.
533 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
534 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
536 * October 2009: Jasmin Blanchette, TUM
537 Nitpick: yet another counterexample generator for Isabelle/HOL.
539 * October 2009: Sascha Boehme, TUM
540 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
542 * October 2009: Florian Haftmann, TUM
543 Refinement of parts of the HOL datatype package.
545 * October 2009: Florian Haftmann, TUM
546 Generic term styles for term antiquotations.
548 * September 2009: Thomas Sewell, NICTA
549 More efficient HOL/record implementation.
551 * September 2009: Sascha Boehme, TUM
552 SMT method using external SMT solvers.
554 * September 2009: Florian Haftmann, TUM
555 Refinement of sets and lattices.
557 * July 2009: Jeremy Avigad and Amine Chaieb
560 * July 2009: Philipp Meyer, TUM
561 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
564 * July 2009: Florian Haftmann, TUM
565 New quickcheck implementation using new code generator.
567 * July 2009: Florian Haftmann, TUM
568 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
571 * June 2009: Florian Haftmann, TUM
572 HOL/Library/Tree: search trees implementing mappings, ready to use
575 * March 2009: Philipp Meyer, TUM
576 Minimization tool for results from Sledgehammer.
579 Contributions to Isabelle2009
580 -----------------------------
582 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
584 Elementary topology in Euclidean space.
586 * March 2009: Johannes Hoelzl, TUM
587 Method "approximation", which proves real valued inequalities by
590 * February 2009: Filip Maric, Univ. of Belgrade
593 * February 2009: Jasmin Christian Blanchette, TUM
594 Misc cleanup of HOL/refute.
596 * February 2009: Timothy Bourke, NICTA
597 New find_consts command.
599 * February 2009: Timothy Bourke, NICTA
600 "solves" criterion for find_theorems and auto_solve option
602 * December 2008: Clemens Ballarin, TUM
603 New locale implementation.
605 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
606 Method "sizechange" for advanced termination proofs.
608 * November 2008: Timothy Bourke, NICTA
609 Performance improvement (factor 50) for find_theorems.
611 * 2008: Florian Haftmann, TUM
612 Various extensions and restructurings in HOL, improvements
613 in evaluation mechanisms, new module binding.ML for name bindings.
615 * October 2008: Fabian Immler, TUM
616 ATP manager for Sledgehammer, based on ML threads instead of Posix
617 processes. Additional ATP wrappers, including remote SystemOnTPTP
620 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
621 Prover for coherent logic.
623 * August 2008: Fabian Immler, TUM
624 Vampire wrapper script for remote SystemOnTPTP service.
627 Contributions to Isabelle2008
628 -----------------------------
631 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
632 HOL library improvements.
634 * 2007/2008: Brian Huffman, PSU
635 HOLCF library improvements.
637 * 2007/2008: Stefan Berghofer, TUM
638 HOL-Nominal package improvements.
640 * March 2008: Markus Reiter, TUM
641 HOL/Library/RBT: red-black trees.
643 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
644 Lukas Bulwahn, TUM and John Matthews, Galois:
645 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
648 * December 2007: Norbert Schirmer, Uni Saarbruecken
649 Misc improvements of record package in HOL.
651 * December 2007: Florian Haftmann, TUM
652 Overloading and class instantiation target.
654 * December 2007: Florian Haftmann, TUM
655 New version of primrec package for local theories.
657 * December 2007: Alexander Krauss, TUM
658 Method "induction_scheme" in HOL.
660 * November 2007: Peter Lammich, Uni Muenster
661 HOL-Lattice: some more lemmas.
664 Contributions to Isabelle2007
665 -----------------------------
667 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
668 State Spaces: The Locale Way (in HOL).
670 * October 2007: Mark A. Hillebrand, DFKI
671 Robust sub/superscripts in LaTeX document output.
673 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
674 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
675 HOL-Word: a library for fixed-size machine words in Isabelle.
677 * August 2007: Brian Huffman, PSU
678 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
680 * June 2007: Amine Chaieb, TUM
681 Semiring normalization and Groebner Bases.
682 Support for dense linear orders.
684 * June 2007: Joe Hurd, Oxford
685 Metis theorem-prover.
687 * 2007: Kong W. Susanto, Cambridge
688 HOL: Metis prover integration.
690 * 2007: Stefan Berghofer, TUM
691 HOL: inductive predicates and sets.
693 * 2007: Norbert Schirmer, TUM
694 HOL/record: misc improvements.
696 * 2006/2007: Alexander Krauss, TUM
697 HOL: function package and related theories on termination.
699 * 2006/2007: Florian Haftmann, TUM
700 Pure: generic code generator framework.
702 HOL: theory reorganization, code generator setup.
704 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
706 HOL/Nominal package and related tools.
708 * November 2006: Lukas Bulwahn, TUM
709 HOL: method "lexicographic_order" for function package.
711 * October 2006: Stefan Hohe, TUM
712 HOL-Algebra: ideals and quotients over rings.
714 * August 2006: Amine Chaieb, TUM
715 Experimental support for generic reflection and reification in HOL.
717 * July 2006: Rafal Kolanski, NICTA
718 Hex (0xFF) and binary (0b1011) numerals.
720 * May 2006: Klaus Aehlig, LMU
721 Command 'normal_form': normalization by evaluation.
723 * May 2006: Amine Chaieb, TUM
724 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
727 * February 2006: Benjamin Porter, NICTA
728 HOL and HOL-Complex: generalised mean value theorem, continuum is
729 not denumerable, harmonic and arithmetic series, and denumerability
732 * October 2005: Martin Wildmoser, TUM
733 Sketch for Isar 'guess' element.
736 Contributions to Isabelle2005
737 -----------------------------
739 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
740 HOL-Complex: Formalization of Taylor series.
742 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
743 Components for SAT solver method using zChaff.
745 * September 2005: Ning Zhang and Christian Urban, LMU Munich
748 * September 2005: Bernhard Haeupler, TUM
749 Method comm_ring for proving equalities in commutative rings.
751 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
752 Various improvements of the HOL and HOL-Complex library.
754 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
755 Some structured proofs about completeness of real numbers.
757 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
758 Improved retrieval of facts from theory/proof context.
760 * February 2005: Lucas Dixon, University of Edinburgh
761 Improved subst method.
763 * 2005: Brian Huffman, OGI
764 Various improvements of HOLCF.
765 Some improvements of the HOL-Complex library.
767 * 2005: Claire Quigley and Jia Meng, University of Cambridge
768 Some support for asynchronous communication with external provers
771 * 2005: Florian Haftmann, TUM
772 Contributions to document 'sugar'.
773 Various ML combinators, notably linear functional transformations.
774 Some cleanup of ML legacy.
775 Additional antiquotations.
776 Improved Isabelle web site.
778 * 2004/2005: David Aspinall, University of Edinburgh
779 Various elements of XML and PGIP based communication with user
780 interfaces (experimental).
782 * 2004/2005: Gerwin Klein, NICTA
783 Contributions to document 'sugar'.
784 Improved Isabelle web site.
785 Improved HTML presentation of theories.
787 * 2004/2005: Clemens Ballarin, TUM
788 Provers: tools for transitive relations and quasi orders.
789 Improved version of locales, notably interpretation of locales.
790 Improved version of HOL-Algebra.
792 * 2004/2005: Amine Chaieb, TUM
793 Improved version of HOL presburger method.
795 * 2004/2005: Steven Obua, TUM
796 Improved version of HOL/Import, support for HOL-Light.
797 Improved version of HOL-Complex-Matrix.
798 Pure/defs: more sophisticated checks on well-formedness of overloading.
799 Pure/Tools: an experimental evaluator for lambda terms.
801 * 2004/2005: Norbert Schirmer, TUM
802 Contributions to document 'sugar'.
803 Improved version of HOL/record.
805 * 2004/2005: Sebastian Skalberg, TUM
806 Improved version of HOL/Import.
807 Some internal ML reorganizations.
809 * 2004/2005: Tjark Weber, TUM
810 SAT solver method using zChaff.
811 Improved version of HOL/refute.