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: Nik Sultana, University of Cambridge
10 Improvements to HOL/TPTP parser and import facilities.
12 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
13 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
15 * Summer 2013: Manuel Eberl, TUM
16 Generation of elimination rules in the function package.
17 New command "fun_cases".
19 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
20 Jasmin Blanchette, TUM
21 Various improvements to BNF-based (co)datatype package, including
22 "primrec_new" and "primcorec" commands and a compatibility layer.
24 * Spring and Summer 2013: Ondrej Kuncar, TUM
25 Various improvements of Lifting and Transfer packages
27 * Spring 2013: Brian Huffman, Galois Inc.
28 Improvements of the Transfer package
30 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
31 Jasmin Blanchette, TUM
32 Various improvements to MaSh, including a server mode.
34 * First half of 2013: Steffen Smolka, TUM
35 Further improvements to Sledgehammer's Isar proof generator.
37 * Summer 2013: Christian Sternagel, JAIST
38 Improved support for ad hoc overloading of constants, including
39 documentation and examples.
41 * May 2013: Florian Haftmann, TUM
42 Ephemeral interpretation in local theories.
44 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
45 Spec_Check: A Quickcheck tool for Isabelle/ML.
47 * April 2013: Stefan Berghofer, secunet Security Networks AG
49 Makarius Wenzel, Université Paris-Sud / LRI
50 Case translations as a separate check phase independent of the
53 * March 2013: Florian Haftmann, TUM
54 Reform of "big operators" on sets.
56 * March 2013: Florian Haftmann, TUM
57 Algebraic locale hierarchy for orderings and (semi)lattices.
59 * February 2013: Florian Haftmann, TUM
60 Reworking and consolidation of code generation for target language
63 * February 2013: Florian Haftmann, TUM
64 Sieve of Eratosthenes.
67 Contributions to Isabelle2013
68 -----------------------------
70 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
71 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
73 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
74 Jasmin Blanchette, TUM
75 Implemented Machine Learning for Sledgehammer (MaSh).
77 * Fall 2012: Steffen Smolka, TUM
78 Various improvements to Sledgehammer's Isar proof generator,
79 including a smart type annotation algorithm and proof shrinking.
81 * December 2012: Alessandro Coglio, Kestrel
82 Contributions to HOL's Lattice library.
84 * November 2012: Fabian Immler, TUM
85 "Symbols" dockable for Isabelle/jEdit.
87 * November 2012: Fabian Immler, TUM
88 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
89 of projective families.
91 * October 2012: Andreas Lochbihler, KIT
92 Efficient construction of red-black trees from sorted associative
95 * September 2012: Florian Haftmann, TUM
96 Lattice instances for type option.
98 * September 2012: Christian Sternagel, JAIST
99 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
100 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
102 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
103 New BNF-based (co)datatype package.
105 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
106 Theories of ordinals and cardinals.
108 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
109 Advanced support for Isabelle sessions and build management, notably
112 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
113 Simproc for rewriting set comprehensions into pointfree expressions.
115 * May 2012: Andreas Lochbihler, KIT
116 Theory of almost everywhere constant functions.
118 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
119 Graphview in Scala/Swing.
122 Contributions to Isabelle2012
123 -----------------------------
125 * April 2012: Johannes Hölzl, TUM
126 Probability: Introduced type to represent measures instead of
129 * April 2012: Johannes Hölzl, Fabian Immler, TUM
130 Float: Moved to Dyadic rationals to represent floating point numers.
132 * April 2012: Thomas Sewell, NICTA and
133 2010: Sascha Boehme, TUM
134 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
135 equalities/inequalities.
137 * March 2012: Christian Sternagel, JAIST
138 Consolidated theory of relation composition.
140 * March 2012: Nik Sultana, University of Cambridge
141 HOL/TPTP parser and import facilities.
143 * March 2012: Cezary Kaliszyk, University of Innsbruck and
144 Alexander Krauss, QAware GmbH
145 Faster and more scalable Import mechanism for HOL Light proofs.
147 * January 2012: Florian Haftmann, TUM, et al.
148 (Re-)Introduction of the "set" type constructor.
150 * 2012: Ondrej Kuncar, TUM
151 New package Lifting, various improvements and refinements to the
154 * 2011/2012: Jasmin Blanchette, TUM
155 Various improvements to Sledgehammer, notably: tighter integration
156 with SPASS, support for more provers (Alt-Ergo, iProver,
159 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
160 Various refinements of local theory infrastructure.
161 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
164 Contributions to Isabelle2011-1
165 -------------------------------
167 * September 2011: Peter Gammie
168 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
170 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
171 Refined theory on complete lattices.
173 * August 2011: Brian Huffman, Portland State University
174 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
176 * June 2011: Brian Huffman, Portland State University
177 Proof method "countable_datatype" for theory Library/Countable.
179 * 2011: Jasmin Blanchette, TUM
180 Various improvements to Sledgehammer, notably: use of sound
181 translations, support for more provers (Waldmeister, LEO-II,
182 Satallax). Further development of Nitpick and 'try' command.
184 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
185 Theory HOL/Library/Cset_Monad allows do notation for computable sets
186 (cset) via the generic monad ad-hoc overloading facility.
188 * 2011: Johannes Hölzl, Armin Heller, TUM and
189 Bogdan Grechuk, University of Edinburgh
190 Theory HOL/Library/Extended_Reals: real numbers extended with plus
193 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
194 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
198 Contributions to Isabelle2011
199 -----------------------------
201 * January 2011: Stefan Berghofer, secunet Security Networks AG
202 HOL-SPARK: an interactive prover back-end for SPARK.
204 * October 2010: Bogdan Grechuk, University of Edinburgh
205 Extended convex analysis in Multivariate Analysis.
207 * October 2010: Dmitriy Traytel, TUM
208 Coercive subtyping via subtype constraints.
210 * October 2010: Alexander Krauss, TUM
211 Command partial_function for function definitions based on complete
212 partial orders in HOL.
214 * September 2010: Florian Haftmann, TUM
215 Refined concepts for evaluation, i.e., normalization of terms using
216 different techniques.
218 * September 2010: Florian Haftmann, TUM
219 Code generation for Scala.
221 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
222 Improved Probability theory in HOL.
224 * July 2010: Florian Haftmann, TUM
225 Reworking and extension of the Imperative HOL framework.
227 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
229 Ad-hoc overloading. Generic do notation for monads.
232 Contributions to Isabelle2009-2
233 -------------------------------
235 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
236 Makarius Wenzel, TUM / LRI
237 Elimination of type classes from proof terms.
239 * April 2010: Florian Haftmann, TUM
240 Reorganization of abstract algebra type classes.
242 * April 2010: Florian Haftmann, TUM
243 Code generation for data representations involving invariants;
244 various collections avaiable in theories Fset, Dlist, RBT,
245 Mapping and AssocList.
247 * March 2010: Sascha Boehme, TUM
248 Efficient SHA1 library for Poly/ML.
250 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
251 Quotient type package for Isabelle/HOL.
254 Contributions to Isabelle2009-1
255 -------------------------------
257 * November 2009, Brian Huffman, PSU
258 New definitional domain package for HOLCF.
260 * November 2009: Robert Himmelmann, TUM
261 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
263 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
264 A tabled implementation of the reflexive transitive closure.
266 * November 2009: Lukas Bulwahn, TUM
267 Predicate Compiler: a compiler for inductive predicates to
268 equational specifications.
270 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
271 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
273 * October 2009: Jasmin Blanchette, TUM
274 Nitpick: yet another counterexample generator for Isabelle/HOL.
276 * October 2009: Sascha Boehme, TUM
277 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
279 * October 2009: Florian Haftmann, TUM
280 Refinement of parts of the HOL datatype package.
282 * October 2009: Florian Haftmann, TUM
283 Generic term styles for term antiquotations.
285 * September 2009: Thomas Sewell, NICTA
286 More efficient HOL/record implementation.
288 * September 2009: Sascha Boehme, TUM
289 SMT method using external SMT solvers.
291 * September 2009: Florian Haftmann, TUM
292 Refinement of sets and lattices.
294 * July 2009: Jeremy Avigad and Amine Chaieb
297 * July 2009: Philipp Meyer, TUM
298 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
301 * July 2009: Florian Haftmann, TUM
302 New quickcheck implementation using new code generator.
304 * July 2009: Florian Haftmann, TUM
305 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
308 * June 2009: Florian Haftmann, TUM
309 HOL/Library/Tree: search trees implementing mappings, ready to use
312 * March 2009: Philipp Meyer, TUM
313 Minimization tool for results from Sledgehammer.
316 Contributions to Isabelle2009
317 -----------------------------
319 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
321 Elementary topology in Euclidean space.
323 * March 2009: Johannes Hoelzl, TUM
324 Method "approximation", which proves real valued inequalities by
327 * February 2009: Filip Maric, Univ. of Belgrade
330 * February 2009: Jasmin Christian Blanchette, TUM
331 Misc cleanup of HOL/refute.
333 * February 2009: Timothy Bourke, NICTA
334 New find_consts command.
336 * February 2009: Timothy Bourke, NICTA
337 "solves" criterion for find_theorems and auto_solve option
339 * December 2008: Clemens Ballarin, TUM
340 New locale implementation.
342 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
343 Method "sizechange" for advanced termination proofs.
345 * November 2008: Timothy Bourke, NICTA
346 Performance improvement (factor 50) for find_theorems.
348 * 2008: Florian Haftmann, TUM
349 Various extensions and restructurings in HOL, improvements
350 in evaluation mechanisms, new module binding.ML for name bindings.
352 * October 2008: Fabian Immler, TUM
353 ATP manager for Sledgehammer, based on ML threads instead of Posix
354 processes. Additional ATP wrappers, including remote SystemOnTPTP
357 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
358 Prover for coherent logic.
360 * August 2008: Fabian Immler, TUM
361 Vampire wrapper script for remote SystemOnTPTP service.
364 Contributions to Isabelle2008
365 -----------------------------
368 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
369 HOL library improvements.
371 * 2007/2008: Brian Huffman, PSU
372 HOLCF library improvements.
374 * 2007/2008: Stefan Berghofer, TUM
375 HOL-Nominal package improvements.
377 * March 2008: Markus Reiter, TUM
378 HOL/Library/RBT: red-black trees.
380 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
381 Lukas Bulwahn, TUM and John Matthews, Galois:
382 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
385 * December 2007: Norbert Schirmer, Uni Saarbruecken
386 Misc improvements of record package in HOL.
388 * December 2007: Florian Haftmann, TUM
389 Overloading and class instantiation target.
391 * December 2007: Florian Haftmann, TUM
392 New version of primrec package for local theories.
394 * December 2007: Alexander Krauss, TUM
395 Method "induction_scheme" in HOL.
397 * November 2007: Peter Lammich, Uni Muenster
398 HOL-Lattice: some more lemmas.
401 Contributions to Isabelle2007
402 -----------------------------
404 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
405 State Spaces: The Locale Way (in HOL).
407 * October 2007: Mark A. Hillebrand, DFKI
408 Robust sub/superscripts in LaTeX document output.
410 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
411 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
412 HOL-Word: a library for fixed-size machine words in Isabelle.
414 * August 2007: Brian Huffman, PSU
415 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
417 * June 2007: Amine Chaieb, TUM
418 Semiring normalization and Groebner Bases.
419 Support for dense linear orders.
421 * June 2007: Joe Hurd, Oxford
422 Metis theorem-prover.
424 * 2007: Kong W. Susanto, Cambridge
425 HOL: Metis prover integration.
427 * 2007: Stefan Berghofer, TUM
428 HOL: inductive predicates and sets.
430 * 2007: Norbert Schirmer, TUM
431 HOL/record: misc improvements.
433 * 2006/2007: Alexander Krauss, TUM
434 HOL: function package and related theories on termination.
436 * 2006/2007: Florian Haftmann, TUM
437 Pure: generic code generator framework.
439 HOL: theory reorganization, code generator setup.
441 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
443 HOL/Nominal package and related tools.
445 * November 2006: Lukas Bulwahn, TUM
446 HOL: method "lexicographic_order" for function package.
448 * October 2006: Stefan Hohe, TUM
449 HOL-Algebra: ideals and quotients over rings.
451 * August 2006: Amine Chaieb, TUM
452 Experimental support for generic reflection and reification in HOL.
454 * July 2006: Rafal Kolanski, NICTA
455 Hex (0xFF) and binary (0b1011) numerals.
457 * May 2006: Klaus Aehlig, LMU
458 Command 'normal_form': normalization by evaluation.
460 * May 2006: Amine Chaieb, TUM
461 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
464 * February 2006: Benjamin Porter, NICTA
465 HOL and HOL-Complex: generalised mean value theorem, continuum is
466 not denumerable, harmonic and arithmetic series, and denumerability
469 * October 2005: Martin Wildmoser, TUM
470 Sketch for Isar 'guess' element.
473 Contributions to Isabelle2005
474 -----------------------------
476 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
477 HOL-Complex: Formalization of Taylor series.
479 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
480 Components for SAT solver method using zChaff.
482 * September 2005: Ning Zhang and Christian Urban, LMU Munich
485 * September 2005: Bernhard Haeupler, TUM
486 Method comm_ring for proving equalities in commutative rings.
488 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
489 Various improvements of the HOL and HOL-Complex library.
491 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
492 Some structured proofs about completeness of real numbers.
494 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
495 Improved retrieval of facts from theory/proof context.
497 * February 2005: Lucas Dixon, University of Edinburgh
498 Improved subst method.
500 * 2005: Brian Huffman, OGI
501 Various improvements of HOLCF.
502 Some improvements of the HOL-Complex library.
504 * 2005: Claire Quigley and Jia Meng, University of Cambridge
505 Some support for asynchronous communication with external provers
508 * 2005: Florian Haftmann, TUM
509 Contributions to document 'sugar'.
510 Various ML combinators, notably linear functional transformations.
511 Some cleanup of ML legacy.
512 Additional antiquotations.
513 Improved Isabelle web site.
515 * 2004/2005: David Aspinall, University of Edinburgh
516 Various elements of XML and PGIP based communication with user
517 interfaces (experimental).
519 * 2004/2005: Gerwin Klein, NICTA
520 Contributions to document 'sugar'.
521 Improved Isabelle web site.
522 Improved HTML presentation of theories.
524 * 2004/2005: Clemens Ballarin, TUM
525 Provers: tools for transitive relations and quasi orders.
526 Improved version of locales, notably interpretation of locales.
527 Improved version of HOL-Algebra.
529 * 2004/2005: Amine Chaieb, TUM
530 Improved version of HOL presburger method.
532 * 2004/2005: Steven Obua, TUM
533 Improved version of HOL/Import, support for HOL-Light.
534 Improved version of HOL-Complex-Matrix.
535 Pure/defs: more sophisticated checks on well-formedness of overloading.
536 Pure/Tools: an experimental evaluator for lambda terms.
538 * 2004/2005: Norbert Schirmer, TUM
539 Contributions to document 'sugar'.
540 Improved version of HOL/record.
542 * 2004/2005: Sebastian Skalberg, TUM
543 Improved version of HOL/Import.
544 Some internal ML reorganizations.
546 * 2004/2005: Tjark Weber, TUM
547 SAT solver method using zChaff.
548 Improved version of HOL/refute.