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 Isabelle2013-1
7 -------------------------------
9 * September 2013: Lars Noschinski, TUM
10 Conversion between function definitions as list of equations and
11 case expressions in HOL.
12 New library Simps_Case_Conv with commands case_of_simps,
15 * September 2013: Nik Sultana, University of Cambridge
16 Improvements to HOL/TPTP parser and import facilities.
18 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
19 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
21 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
22 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
24 * Summer 2013: Manuel Eberl, TUM
25 Generation of elimination rules in the function package.
26 New command "fun_cases".
28 * Summer 2013: Christian Sternagel, JAIST
29 Improved support for ad hoc overloading of constants, including
30 documentation and examples.
32 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
33 Jasmin Blanchette, TUM
34 Various improvements to BNF-based (co)datatype package, including
35 "primrec_new" and "primcorec" commands and a compatibility layer.
37 * Spring and Summer 2013: Ondrej Kuncar, TUM
38 Various improvements of Lifting and Transfer packages.
40 * Spring 2013: Brian Huffman, Galois Inc.
41 Improvements of the Transfer package.
43 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
44 Jasmin Blanchette, TUM
45 Various improvements to MaSh, including a server mode.
47 * First half of 2013: Steffen Smolka, TUM
48 Further improvements to Sledgehammer's Isar proof generator.
50 * May 2013: Florian Haftmann, TUM
51 Ephemeral interpretation in local theories.
53 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
54 Spec_Check: A Quickcheck tool for Isabelle/ML.
56 * April 2013: Stefan Berghofer, secunet Security Networks AG
58 Makarius Wenzel, Université Paris-Sud / LRI
59 Case translations as a separate check phase independent of the
62 * March 2013: Florian Haftmann, TUM
63 Reform of "big operators" on sets.
65 * March 2013: Florian Haftmann, TUM
66 Algebraic locale hierarchy for orderings and (semi)lattices.
68 * February 2013: Florian Haftmann, TUM
69 Reworking and consolidation of code generation for target language
72 * February 2013: Florian Haftmann, TUM
73 Sieve of Eratosthenes.
76 Contributions to Isabelle2013
77 -----------------------------
79 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
80 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
82 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
83 Jasmin Blanchette, TUM
84 Implemented Machine Learning for Sledgehammer (MaSh).
86 * Fall 2012: Steffen Smolka, TUM
87 Various improvements to Sledgehammer's Isar proof generator,
88 including a smart type annotation algorithm and proof shrinking.
90 * December 2012: Alessandro Coglio, Kestrel
91 Contributions to HOL's Lattice library.
93 * November 2012: Fabian Immler, TUM
94 "Symbols" dockable for Isabelle/jEdit.
96 * November 2012: Fabian Immler, TUM
97 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
98 of projective families.
100 * October 2012: Andreas Lochbihler, KIT
101 Efficient construction of red-black trees from sorted associative
104 * September 2012: Florian Haftmann, TUM
105 Lattice instances for type option.
107 * September 2012: Christian Sternagel, JAIST
108 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
109 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
111 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
112 New BNF-based (co)datatype package.
114 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
115 Theories of ordinals and cardinals.
117 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
118 Advanced support for Isabelle sessions and build management, notably
121 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
122 Simproc for rewriting set comprehensions into pointfree expressions.
124 * May 2012: Andreas Lochbihler, KIT
125 Theory of almost everywhere constant functions.
127 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
128 Graphview in Scala/Swing.
131 Contributions to Isabelle2012
132 -----------------------------
134 * April 2012: Johannes Hölzl, TUM
135 Probability: Introduced type to represent measures instead of
138 * April 2012: Johannes Hölzl, Fabian Immler, TUM
139 Float: Moved to Dyadic rationals to represent floating point numers.
141 * April 2012: Thomas Sewell, NICTA and
142 2010: Sascha Boehme, TUM
143 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
144 equalities/inequalities.
146 * March 2012: Christian Sternagel, JAIST
147 Consolidated theory of relation composition.
149 * March 2012: Nik Sultana, University of Cambridge
150 HOL/TPTP parser and import facilities.
152 * March 2012: Cezary Kaliszyk, University of Innsbruck and
153 Alexander Krauss, QAware GmbH
154 Faster and more scalable Import mechanism for HOL Light proofs.
156 * January 2012: Florian Haftmann, TUM, et al.
157 (Re-)Introduction of the "set" type constructor.
159 * 2012: Ondrej Kuncar, TUM
160 New package Lifting, various improvements and refinements to the
163 * 2011/2012: Jasmin Blanchette, TUM
164 Various improvements to Sledgehammer, notably: tighter integration
165 with SPASS, support for more provers (Alt-Ergo, iProver,
168 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
169 Various refinements of local theory infrastructure.
170 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
173 Contributions to Isabelle2011-1
174 -------------------------------
176 * September 2011: Peter Gammie
177 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
179 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
180 Refined theory on complete lattices.
182 * August 2011: Brian Huffman, Portland State University
183 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
185 * June 2011: Brian Huffman, Portland State University
186 Proof method "countable_datatype" for theory Library/Countable.
188 * 2011: Jasmin Blanchette, TUM
189 Various improvements to Sledgehammer, notably: use of sound
190 translations, support for more provers (Waldmeister, LEO-II,
191 Satallax). Further development of Nitpick and 'try' command.
193 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
194 Theory HOL/Library/Cset_Monad allows do notation for computable sets
195 (cset) via the generic monad ad-hoc overloading facility.
197 * 2011: Johannes Hölzl, Armin Heller, TUM and
198 Bogdan Grechuk, University of Edinburgh
199 Theory HOL/Library/Extended_Reals: real numbers extended with plus
202 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
203 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
207 Contributions to Isabelle2011
208 -----------------------------
210 * January 2011: Stefan Berghofer, secunet Security Networks AG
211 HOL-SPARK: an interactive prover back-end for SPARK.
213 * October 2010: Bogdan Grechuk, University of Edinburgh
214 Extended convex analysis in Multivariate Analysis.
216 * October 2010: Dmitriy Traytel, TUM
217 Coercive subtyping via subtype constraints.
219 * October 2010: Alexander Krauss, TUM
220 Command partial_function for function definitions based on complete
221 partial orders in HOL.
223 * September 2010: Florian Haftmann, TUM
224 Refined concepts for evaluation, i.e., normalization of terms using
225 different techniques.
227 * September 2010: Florian Haftmann, TUM
228 Code generation for Scala.
230 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
231 Improved Probability theory in HOL.
233 * July 2010: Florian Haftmann, TUM
234 Reworking and extension of the Imperative HOL framework.
236 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
238 Ad-hoc overloading. Generic do notation for monads.
241 Contributions to Isabelle2009-2
242 -------------------------------
244 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
245 Makarius Wenzel, TUM / LRI
246 Elimination of type classes from proof terms.
248 * April 2010: Florian Haftmann, TUM
249 Reorganization of abstract algebra type classes.
251 * April 2010: Florian Haftmann, TUM
252 Code generation for data representations involving invariants;
253 various collections avaiable in theories Fset, Dlist, RBT,
254 Mapping and AssocList.
256 * March 2010: Sascha Boehme, TUM
257 Efficient SHA1 library for Poly/ML.
259 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
260 Quotient type package for Isabelle/HOL.
263 Contributions to Isabelle2009-1
264 -------------------------------
266 * November 2009, Brian Huffman, PSU
267 New definitional domain package for HOLCF.
269 * November 2009: Robert Himmelmann, TUM
270 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
272 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
273 A tabled implementation of the reflexive transitive closure.
275 * November 2009: Lukas Bulwahn, TUM
276 Predicate Compiler: a compiler for inductive predicates to
277 equational specifications.
279 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
280 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
282 * October 2009: Jasmin Blanchette, TUM
283 Nitpick: yet another counterexample generator for Isabelle/HOL.
285 * October 2009: Sascha Boehme, TUM
286 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
288 * October 2009: Florian Haftmann, TUM
289 Refinement of parts of the HOL datatype package.
291 * October 2009: Florian Haftmann, TUM
292 Generic term styles for term antiquotations.
294 * September 2009: Thomas Sewell, NICTA
295 More efficient HOL/record implementation.
297 * September 2009: Sascha Boehme, TUM
298 SMT method using external SMT solvers.
300 * September 2009: Florian Haftmann, TUM
301 Refinement of sets and lattices.
303 * July 2009: Jeremy Avigad and Amine Chaieb
306 * July 2009: Philipp Meyer, TUM
307 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
310 * July 2009: Florian Haftmann, TUM
311 New quickcheck implementation using new code generator.
313 * July 2009: Florian Haftmann, TUM
314 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
317 * June 2009: Florian Haftmann, TUM
318 HOL/Library/Tree: search trees implementing mappings, ready to use
321 * March 2009: Philipp Meyer, TUM
322 Minimization tool for results from Sledgehammer.
325 Contributions to Isabelle2009
326 -----------------------------
328 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
330 Elementary topology in Euclidean space.
332 * March 2009: Johannes Hoelzl, TUM
333 Method "approximation", which proves real valued inequalities by
336 * February 2009: Filip Maric, Univ. of Belgrade
339 * February 2009: Jasmin Christian Blanchette, TUM
340 Misc cleanup of HOL/refute.
342 * February 2009: Timothy Bourke, NICTA
343 New find_consts command.
345 * February 2009: Timothy Bourke, NICTA
346 "solves" criterion for find_theorems and auto_solve option
348 * December 2008: Clemens Ballarin, TUM
349 New locale implementation.
351 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
352 Method "sizechange" for advanced termination proofs.
354 * November 2008: Timothy Bourke, NICTA
355 Performance improvement (factor 50) for find_theorems.
357 * 2008: Florian Haftmann, TUM
358 Various extensions and restructurings in HOL, improvements
359 in evaluation mechanisms, new module binding.ML for name bindings.
361 * October 2008: Fabian Immler, TUM
362 ATP manager for Sledgehammer, based on ML threads instead of Posix
363 processes. Additional ATP wrappers, including remote SystemOnTPTP
366 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
367 Prover for coherent logic.
369 * August 2008: Fabian Immler, TUM
370 Vampire wrapper script for remote SystemOnTPTP service.
373 Contributions to Isabelle2008
374 -----------------------------
377 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
378 HOL library improvements.
380 * 2007/2008: Brian Huffman, PSU
381 HOLCF library improvements.
383 * 2007/2008: Stefan Berghofer, TUM
384 HOL-Nominal package improvements.
386 * March 2008: Markus Reiter, TUM
387 HOL/Library/RBT: red-black trees.
389 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
390 Lukas Bulwahn, TUM and John Matthews, Galois:
391 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
394 * December 2007: Norbert Schirmer, Uni Saarbruecken
395 Misc improvements of record package in HOL.
397 * December 2007: Florian Haftmann, TUM
398 Overloading and class instantiation target.
400 * December 2007: Florian Haftmann, TUM
401 New version of primrec package for local theories.
403 * December 2007: Alexander Krauss, TUM
404 Method "induction_scheme" in HOL.
406 * November 2007: Peter Lammich, Uni Muenster
407 HOL-Lattice: some more lemmas.
410 Contributions to Isabelle2007
411 -----------------------------
413 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
414 State Spaces: The Locale Way (in HOL).
416 * October 2007: Mark A. Hillebrand, DFKI
417 Robust sub/superscripts in LaTeX document output.
419 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
420 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
421 HOL-Word: a library for fixed-size machine words in Isabelle.
423 * August 2007: Brian Huffman, PSU
424 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
426 * June 2007: Amine Chaieb, TUM
427 Semiring normalization and Groebner Bases.
428 Support for dense linear orders.
430 * June 2007: Joe Hurd, Oxford
431 Metis theorem-prover.
433 * 2007: Kong W. Susanto, Cambridge
434 HOL: Metis prover integration.
436 * 2007: Stefan Berghofer, TUM
437 HOL: inductive predicates and sets.
439 * 2007: Norbert Schirmer, TUM
440 HOL/record: misc improvements.
442 * 2006/2007: Alexander Krauss, TUM
443 HOL: function package and related theories on termination.
445 * 2006/2007: Florian Haftmann, TUM
446 Pure: generic code generator framework.
448 HOL: theory reorganization, code generator setup.
450 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
452 HOL/Nominal package and related tools.
454 * November 2006: Lukas Bulwahn, TUM
455 HOL: method "lexicographic_order" for function package.
457 * October 2006: Stefan Hohe, TUM
458 HOL-Algebra: ideals and quotients over rings.
460 * August 2006: Amine Chaieb, TUM
461 Experimental support for generic reflection and reification in HOL.
463 * July 2006: Rafal Kolanski, NICTA
464 Hex (0xFF) and binary (0b1011) numerals.
466 * May 2006: Klaus Aehlig, LMU
467 Command 'normal_form': normalization by evaluation.
469 * May 2006: Amine Chaieb, TUM
470 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
473 * February 2006: Benjamin Porter, NICTA
474 HOL and HOL-Complex: generalised mean value theorem, continuum is
475 not denumerable, harmonic and arithmetic series, and denumerability
478 * October 2005: Martin Wildmoser, TUM
479 Sketch for Isar 'guess' element.
482 Contributions to Isabelle2005
483 -----------------------------
485 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
486 HOL-Complex: Formalization of Taylor series.
488 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
489 Components for SAT solver method using zChaff.
491 * September 2005: Ning Zhang and Christian Urban, LMU Munich
494 * September 2005: Bernhard Haeupler, TUM
495 Method comm_ring for proving equalities in commutative rings.
497 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
498 Various improvements of the HOL and HOL-Complex library.
500 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
501 Some structured proofs about completeness of real numbers.
503 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
504 Improved retrieval of facts from theory/proof context.
506 * February 2005: Lucas Dixon, University of Edinburgh
507 Improved subst method.
509 * 2005: Brian Huffman, OGI
510 Various improvements of HOLCF.
511 Some improvements of the HOL-Complex library.
513 * 2005: Claire Quigley and Jia Meng, University of Cambridge
514 Some support for asynchronous communication with external provers
517 * 2005: Florian Haftmann, TUM
518 Contributions to document 'sugar'.
519 Various ML combinators, notably linear functional transformations.
520 Some cleanup of ML legacy.
521 Additional antiquotations.
522 Improved Isabelle web site.
524 * 2004/2005: David Aspinall, University of Edinburgh
525 Various elements of XML and PGIP based communication with user
526 interfaces (experimental).
528 * 2004/2005: Gerwin Klein, NICTA
529 Contributions to document 'sugar'.
530 Improved Isabelle web site.
531 Improved HTML presentation of theories.
533 * 2004/2005: Clemens Ballarin, TUM
534 Provers: tools for transitive relations and quasi orders.
535 Improved version of locales, notably interpretation of locales.
536 Improved version of HOL-Algebra.
538 * 2004/2005: Amine Chaieb, TUM
539 Improved version of HOL presburger method.
541 * 2004/2005: Steven Obua, TUM
542 Improved version of HOL/Import, support for HOL-Light.
543 Improved version of HOL-Complex-Matrix.
544 Pure/defs: more sophisticated checks on well-formedness of overloading.
545 Pure/Tools: an experimental evaluator for lambda terms.
547 * 2004/2005: Norbert Schirmer, TUM
548 Contributions to document 'sugar'.
549 Improved version of HOL/record.
551 * 2004/2005: Sebastian Skalberg, TUM
552 Improved version of HOL/Import.
553 Some internal ML reorganizations.
555 * 2004/2005: Tjark Weber, TUM
556 SAT solver method using zChaff.
557 Improved version of HOL/refute.