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 * September 2013: Nik Sultana, University of Cambridge
10 Improvements to HOL/TPTP parser and import facilities.
12 * Summer 2013: Manuel Eberl, TUM
13 Generation of elimination rules in the function package.
14 New command "fun_cases".
16 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
17 Jasmin Blanchette, TUM
18 Various improvements to BNF-based (co)datatype package, including a
19 "primrec_new" command and a compatibility layer.
21 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
22 Jasmin Blanchette, TUM
23 Various improvements to MaSh, including a server mode.
25 * First half of 2013: Steffen Smolka, TUM
26 Further improvements to Sledgehammer's Isar proof generator.
28 * Summer 2013: Christian Sternagel, JAIST
29 Improved support for ad hoc overloading of constants, including
30 documentation and examples.
32 * May 2013: Florian Haftmann, TUM
33 Ephemeral interpretation in local theories.
35 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
36 Spec_Check: A Quickcheck tool for Isabelle/ML.
38 * April 2013: Stefan Berghofer, secunet Security Networks AG
40 Makarius Wenzel, Université Paris-Sud / LRI
41 Case translations as a separate check phase independent of the
44 * March 2013: Florian Haftmann, TUM
45 Reform of "big operators" on sets.
47 * March 2013: Florian Haftmann, TUM
48 Algebraic locale hierarchy for orderings and (semi)lattices.
50 * February 2013: Florian Haftmann, TUM
51 Reworking and consolidation of code generation for target language
54 * February 2013: Florian Haftmann, TUM
55 Sieve of Eratosthenes.
58 Contributions to Isabelle2013
59 -----------------------------
61 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
62 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
64 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
65 Jasmin Blanchette, TUM
66 Implemented Machine Learning for Sledgehammer (MaSh).
68 * Fall 2012: Steffen Smolka, TUM
69 Various improvements to Sledgehammer's Isar proof generator,
70 including a smart type annotation algorithm and proof shrinking.
72 * December 2012: Alessandro Coglio, Kestrel
73 Contributions to HOL's Lattice library.
75 * November 2012: Fabian Immler, TUM
76 "Symbols" dockable for Isabelle/jEdit.
78 * November 2012: Fabian Immler, TUM
79 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
80 of projective families.
82 * October 2012: Andreas Lochbihler, KIT
83 Efficient construction of red-black trees from sorted associative
86 * September 2012: Florian Haftmann, TUM
87 Lattice instances for type option.
89 * September 2012: Christian Sternagel, JAIST
90 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
91 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
93 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
94 New BNF-based (co)datatype package.
96 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
97 Theories of ordinals and cardinals.
99 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
100 Advanced support for Isabelle sessions and build management, notably
103 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
104 Simproc for rewriting set comprehensions into pointfree expressions.
106 * May 2012: Andreas Lochbihler, KIT
107 Theory of almost everywhere constant functions.
109 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
110 Graphview in Scala/Swing.
113 Contributions to Isabelle2012
114 -----------------------------
116 * April 2012: Johannes Hölzl, TUM
117 Probability: Introduced type to represent measures instead of
120 * April 2012: Johannes Hölzl, Fabian Immler, TUM
121 Float: Moved to Dyadic rationals to represent floating point numers.
123 * April 2012: Thomas Sewell, NICTA and
124 2010: Sascha Boehme, TUM
125 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
126 equalities/inequalities.
128 * March 2012: Christian Sternagel, JAIST
129 Consolidated theory of relation composition.
131 * March 2012: Nik Sultana, University of Cambridge
132 HOL/TPTP parser and import facilities.
134 * March 2012: Cezary Kaliszyk, University of Innsbruck and
135 Alexander Krauss, QAware GmbH
136 Faster and more scalable Import mechanism for HOL Light proofs.
138 * January 2012: Florian Haftmann, TUM, et al.
139 (Re-)Introduction of the "set" type constructor.
141 * 2012: Ondrej Kuncar, TUM
142 New package Lifting, various improvements and refinements to the
145 * 2011/2012: Jasmin Blanchette, TUM
146 Various improvements to Sledgehammer, notably: tighter integration
147 with SPASS, support for more provers (Alt-Ergo, iProver,
150 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
151 Various refinements of local theory infrastructure.
152 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
155 Contributions to Isabelle2011-1
156 -------------------------------
158 * September 2011: Peter Gammie
159 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
161 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
162 Refined theory on complete lattices.
164 * August 2011: Brian Huffman, Portland State University
165 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
167 * June 2011: Brian Huffman, Portland State University
168 Proof method "countable_datatype" for theory Library/Countable.
170 * 2011: Jasmin Blanchette, TUM
171 Various improvements to Sledgehammer, notably: use of sound
172 translations, support for more provers (Waldmeister, LEO-II,
173 Satallax). Further development of Nitpick and 'try' command.
175 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
176 Theory HOL/Library/Cset_Monad allows do notation for computable sets
177 (cset) via the generic monad ad-hoc overloading facility.
179 * 2011: Johannes Hölzl, Armin Heller, TUM and
180 Bogdan Grechuk, University of Edinburgh
181 Theory HOL/Library/Extended_Reals: real numbers extended with plus
184 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
185 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
189 Contributions to Isabelle2011
190 -----------------------------
192 * January 2011: Stefan Berghofer, secunet Security Networks AG
193 HOL-SPARK: an interactive prover back-end for SPARK.
195 * October 2010: Bogdan Grechuk, University of Edinburgh
196 Extended convex analysis in Multivariate Analysis.
198 * October 2010: Dmitriy Traytel, TUM
199 Coercive subtyping via subtype constraints.
201 * October 2010: Alexander Krauss, TUM
202 Command partial_function for function definitions based on complete
203 partial orders in HOL.
205 * September 2010: Florian Haftmann, TUM
206 Refined concepts for evaluation, i.e., normalization of terms using
207 different techniques.
209 * September 2010: Florian Haftmann, TUM
210 Code generation for Scala.
212 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
213 Improved Probability theory in HOL.
215 * July 2010: Florian Haftmann, TUM
216 Reworking and extension of the Imperative HOL framework.
218 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
220 Ad-hoc overloading. Generic do notation for monads.
223 Contributions to Isabelle2009-2
224 -------------------------------
226 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
227 Makarius Wenzel, TUM / LRI
228 Elimination of type classes from proof terms.
230 * April 2010: Florian Haftmann, TUM
231 Reorganization of abstract algebra type classes.
233 * April 2010: Florian Haftmann, TUM
234 Code generation for data representations involving invariants;
235 various collections avaiable in theories Fset, Dlist, RBT,
236 Mapping and AssocList.
238 * March 2010: Sascha Boehme, TUM
239 Efficient SHA1 library for Poly/ML.
241 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
242 Quotient type package for Isabelle/HOL.
245 Contributions to Isabelle2009-1
246 -------------------------------
248 * November 2009, Brian Huffman, PSU
249 New definitional domain package for HOLCF.
251 * November 2009: Robert Himmelmann, TUM
252 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
254 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
255 A tabled implementation of the reflexive transitive closure.
257 * November 2009: Lukas Bulwahn, TUM
258 Predicate Compiler: a compiler for inductive predicates to
259 equational specifications.
261 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
262 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
264 * October 2009: Jasmin Blanchette, TUM
265 Nitpick: yet another counterexample generator for Isabelle/HOL.
267 * October 2009: Sascha Boehme, TUM
268 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
270 * October 2009: Florian Haftmann, TUM
271 Refinement of parts of the HOL datatype package.
273 * October 2009: Florian Haftmann, TUM
274 Generic term styles for term antiquotations.
276 * September 2009: Thomas Sewell, NICTA
277 More efficient HOL/record implementation.
279 * September 2009: Sascha Boehme, TUM
280 SMT method using external SMT solvers.
282 * September 2009: Florian Haftmann, TUM
283 Refinement of sets and lattices.
285 * July 2009: Jeremy Avigad and Amine Chaieb
288 * July 2009: Philipp Meyer, TUM
289 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
292 * July 2009: Florian Haftmann, TUM
293 New quickcheck implementation using new code generator.
295 * July 2009: Florian Haftmann, TUM
296 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
299 * June 2009: Florian Haftmann, TUM
300 HOL/Library/Tree: search trees implementing mappings, ready to use
303 * March 2009: Philipp Meyer, TUM
304 Minimization tool for results from Sledgehammer.
307 Contributions to Isabelle2009
308 -----------------------------
310 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
312 Elementary topology in Euclidean space.
314 * March 2009: Johannes Hoelzl, TUM
315 Method "approximation", which proves real valued inequalities by
318 * February 2009: Filip Maric, Univ. of Belgrade
321 * February 2009: Jasmin Christian Blanchette, TUM
322 Misc cleanup of HOL/refute.
324 * February 2009: Timothy Bourke, NICTA
325 New find_consts command.
327 * February 2009: Timothy Bourke, NICTA
328 "solves" criterion for find_theorems and auto_solve option
330 * December 2008: Clemens Ballarin, TUM
331 New locale implementation.
333 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
334 Method "sizechange" for advanced termination proofs.
336 * November 2008: Timothy Bourke, NICTA
337 Performance improvement (factor 50) for find_theorems.
339 * 2008: Florian Haftmann, TUM
340 Various extensions and restructurings in HOL, improvements
341 in evaluation mechanisms, new module binding.ML for name bindings.
343 * October 2008: Fabian Immler, TUM
344 ATP manager for Sledgehammer, based on ML threads instead of Posix
345 processes. Additional ATP wrappers, including remote SystemOnTPTP
348 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
349 Prover for coherent logic.
351 * August 2008: Fabian Immler, TUM
352 Vampire wrapper script for remote SystemOnTPTP service.
355 Contributions to Isabelle2008
356 -----------------------------
359 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
360 HOL library improvements.
362 * 2007/2008: Brian Huffman, PSU
363 HOLCF library improvements.
365 * 2007/2008: Stefan Berghofer, TUM
366 HOL-Nominal package improvements.
368 * March 2008: Markus Reiter, TUM
369 HOL/Library/RBT: red-black trees.
371 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
372 Lukas Bulwahn, TUM and John Matthews, Galois:
373 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
376 * December 2007: Norbert Schirmer, Uni Saarbruecken
377 Misc improvements of record package in HOL.
379 * December 2007: Florian Haftmann, TUM
380 Overloading and class instantiation target.
382 * December 2007: Florian Haftmann, TUM
383 New version of primrec package for local theories.
385 * December 2007: Alexander Krauss, TUM
386 Method "induction_scheme" in HOL.
388 * November 2007: Peter Lammich, Uni Muenster
389 HOL-Lattice: some more lemmas.
392 Contributions to Isabelle2007
393 -----------------------------
395 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
396 State Spaces: The Locale Way (in HOL).
398 * October 2007: Mark A. Hillebrand, DFKI
399 Robust sub/superscripts in LaTeX document output.
401 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
402 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
403 HOL-Word: a library for fixed-size machine words in Isabelle.
405 * August 2007: Brian Huffman, PSU
406 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
408 * June 2007: Amine Chaieb, TUM
409 Semiring normalization and Groebner Bases.
410 Support for dense linear orders.
412 * June 2007: Joe Hurd, Oxford
413 Metis theorem-prover.
415 * 2007: Kong W. Susanto, Cambridge
416 HOL: Metis prover integration.
418 * 2007: Stefan Berghofer, TUM
419 HOL: inductive predicates and sets.
421 * 2007: Norbert Schirmer, TUM
422 HOL/record: misc improvements.
424 * 2006/2007: Alexander Krauss, TUM
425 HOL: function package and related theories on termination.
427 * 2006/2007: Florian Haftmann, TUM
428 Pure: generic code generator framework.
430 HOL: theory reorganization, code generator setup.
432 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
434 HOL/Nominal package and related tools.
436 * November 2006: Lukas Bulwahn, TUM
437 HOL: method "lexicographic_order" for function package.
439 * October 2006: Stefan Hohe, TUM
440 HOL-Algebra: ideals and quotients over rings.
442 * August 2006: Amine Chaieb, TUM
443 Experimental support for generic reflection and reification in HOL.
445 * July 2006: Rafal Kolanski, NICTA
446 Hex (0xFF) and binary (0b1011) numerals.
448 * May 2006: Klaus Aehlig, LMU
449 Command 'normal_form': normalization by evaluation.
451 * May 2006: Amine Chaieb, TUM
452 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
455 * February 2006: Benjamin Porter, NICTA
456 HOL and HOL-Complex: generalised mean value theorem, continuum is
457 not denumerable, harmonic and arithmetic series, and denumerability
460 * October 2005: Martin Wildmoser, TUM
461 Sketch for Isar 'guess' element.
464 Contributions to Isabelle2005
465 -----------------------------
467 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
468 HOL-Complex: Formalization of Taylor series.
470 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
471 Components for SAT solver method using zChaff.
473 * September 2005: Ning Zhang and Christian Urban, LMU Munich
476 * September 2005: Bernhard Haeupler, TUM
477 Method comm_ring for proving equalities in commutative rings.
479 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
480 Various improvements of the HOL and HOL-Complex library.
482 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
483 Some structured proofs about completeness of real numbers.
485 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
486 Improved retrieval of facts from theory/proof context.
488 * February 2005: Lucas Dixon, University of Edinburgh
489 Improved subst method.
491 * 2005: Brian Huffman, OGI
492 Various improvements of HOLCF.
493 Some improvements of the HOL-Complex library.
495 * 2005: Claire Quigley and Jia Meng, University of Cambridge
496 Some support for asynchronous communication with external provers
499 * 2005: Florian Haftmann, TUM
500 Contributions to document 'sugar'.
501 Various ML combinators, notably linear functional transformations.
502 Some cleanup of ML legacy.
503 Additional antiquotations.
504 Improved Isabelle web site.
506 * 2004/2005: David Aspinall, University of Edinburgh
507 Various elements of XML and PGIP based communication with user
508 interfaces (experimental).
510 * 2004/2005: Gerwin Klein, NICTA
511 Contributions to document 'sugar'.
512 Improved Isabelle web site.
513 Improved HTML presentation of theories.
515 * 2004/2005: Clemens Ballarin, TUM
516 Provers: tools for transitive relations and quasi orders.
517 Improved version of locales, notably interpretation of locales.
518 Improved version of HOL-Algebra.
520 * 2004/2005: Amine Chaieb, TUM
521 Improved version of HOL presburger method.
523 * 2004/2005: Steven Obua, TUM
524 Improved version of HOL/Import, support for HOL-Light.
525 Improved version of HOL-Complex-Matrix.
526 Pure/defs: more sophisticated checks on well-formedness of overloading.
527 Pure/Tools: an experimental evaluator for lambda terms.
529 * 2004/2005: Norbert Schirmer, TUM
530 Contributions to document 'sugar'.
531 Improved version of HOL/record.
533 * 2004/2005: Sebastian Skalberg, TUM
534 Improved version of HOL/Import.
535 Some internal ML reorganizations.
537 * 2004/2005: Tjark Weber, TUM
538 SAT solver method using zChaff.
539 Improved version of HOL/refute.