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