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 Contributions to Isabelle2013
10 -----------------------------
12 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
13 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
15 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
16 Jasmin Blanchette, TUM
17 Implemented Machine Learning for Sledgehammer (MaSh).
19 * Fall 2012: Steffen Smolka, TUM
20 Various improvements to Sledgehammer's Isar proof generator,
21 including a smart type annotation algorithm and proof shrinking.
23 * December 2012: Alessandro Coglio, Kestrel
24 Contributions to HOL's Lattice library.
26 * November 2012: Fabian Immler, TUM
27 "Symbols" dockable for Isabelle/jEdit.
29 * November 2012: Fabian Immler, TUM
30 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
31 of projective families.
33 * October 2012: Andreas Lochbihler, KIT
34 Efficient construction of red-black trees from sorted associative
37 * September 2012: Florian Haftmann, TUM
38 Lattice instances for type option.
40 * September 2012: Christian Sternagel, JAIST
41 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
42 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
44 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
45 New BNF-based (co)datatype package.
47 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
48 Theories of ordinals and cardinals.
50 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
51 Advanced support for Isabelle sessions and build management, notably
54 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
55 Simproc for rewriting set comprehensions into pointfree expressions.
57 * May 2012: Andreas Lochbihler, KIT
58 Theory of almost everywhere constant functions.
60 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
61 Graphview in Scala/Swing.
64 Contributions to Isabelle2012
65 -----------------------------
67 * April 2012: Johannes Hölzl, TUM
68 Probability: Introduced type to represent measures instead of
71 * April 2012: Johannes Hölzl, Fabian Immler, TUM
72 Float: Moved to Dyadic rationals to represent floating point numers.
74 * April 2012: Thomas Sewell, NICTA and
75 2010: Sascha Boehme, TUM
76 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
77 equalities/inequalities.
79 * March 2012: Christian Sternagel, JAIST
80 Consolidated theory of relation composition.
82 * March 2012: Nik Sultana, University of Cambridge
83 HOL/TPTP parser and import facilities.
85 * March 2012: Cezary Kaliszyk, University of Innsbruck and
86 Alexander Krauss, QAware GmbH
87 Faster and more scalable Import mechanism for HOL Light proofs.
89 * January 2012: Florian Haftmann, TUM, et al.
90 (Re-)Introduction of the "set" type constructor.
92 * 2012: Ondrej Kuncar, TUM
93 New package Lifting, various improvements and refinements to the
96 * 2011/2012: Jasmin Blanchette, TUM
97 Various improvements to Sledgehammer, notably: tighter integration
98 with SPASS, support for more provers (Alt-Ergo, iProver,
101 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
102 Various refinements of local theory infrastructure.
103 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
106 Contributions to Isabelle2011-1
107 -------------------------------
109 * September 2011: Peter Gammie
110 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
112 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
113 Refined theory on complete lattices.
115 * August 2011: Brian Huffman, Portland State University
116 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
118 * June 2011: Brian Huffman, Portland State University
119 Proof method "countable_datatype" for theory Library/Countable.
121 * 2011: Jasmin Blanchette, TUM
122 Various improvements to Sledgehammer, notably: use of sound
123 translations, support for more provers (Waldmeister, LEO-II,
124 Satallax). Further development of Nitpick and 'try' command.
126 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
127 Theory HOL/Library/Cset_Monad allows do notation for computable sets
128 (cset) via the generic monad ad-hoc overloading facility.
130 * 2011: Johannes Hölzl, Armin Heller, TUM and
131 Bogdan Grechuk, University of Edinburgh
132 Theory HOL/Library/Extended_Reals: real numbers extended with plus
135 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
136 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
140 Contributions to Isabelle2011
141 -----------------------------
143 * January 2011: Stefan Berghofer, secunet Security Networks AG
144 HOL-SPARK: an interactive prover back-end for SPARK.
146 * October 2010: Bogdan Grechuk, University of Edinburgh
147 Extended convex analysis in Multivariate Analysis.
149 * October 2010: Dmitriy Traytel, TUM
150 Coercive subtyping via subtype constraints.
152 * October 2010: Alexander Krauss, TUM
153 Command partial_function for function definitions based on complete
154 partial orders in HOL.
156 * September 2010: Florian Haftmann, TUM
157 Refined concepts for evaluation, i.e., normalization of terms using
158 different techniques.
160 * September 2010: Florian Haftmann, TUM
161 Code generation for Scala.
163 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
164 Improved Probability theory in HOL.
166 * July 2010: Florian Haftmann, TUM
167 Reworking and extension of the Imperative HOL framework.
169 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
171 Ad-hoc overloading. Generic do notation for monads.
174 Contributions to Isabelle2009-2
175 -------------------------------
177 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
178 Makarius Wenzel, TUM / LRI
179 Elimination of type classes from proof terms.
181 * April 2010: Florian Haftmann, TUM
182 Reorganization of abstract algebra type classes.
184 * April 2010: Florian Haftmann, TUM
185 Code generation for data representations involving invariants;
186 various collections avaiable in theories Fset, Dlist, RBT,
187 Mapping and AssocList.
189 * March 2010: Sascha Boehme, TUM
190 Efficient SHA1 library for Poly/ML.
192 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
193 Quotient type package for Isabelle/HOL.
196 Contributions to Isabelle2009-1
197 -------------------------------
199 * November 2009, Brian Huffman, PSU
200 New definitional domain package for HOLCF.
202 * November 2009: Robert Himmelmann, TUM
203 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
205 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
206 A tabled implementation of the reflexive transitive closure.
208 * November 2009: Lukas Bulwahn, TUM
209 Predicate Compiler: a compiler for inductive predicates to
210 equational specifications.
212 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
213 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
215 * October 2009: Jasmin Blanchette, TUM
216 Nitpick: yet another counterexample generator for Isabelle/HOL.
218 * October 2009: Sascha Boehme, TUM
219 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
221 * October 2009: Florian Haftmann, TUM
222 Refinement of parts of the HOL datatype package.
224 * October 2009: Florian Haftmann, TUM
225 Generic term styles for term antiquotations.
227 * September 2009: Thomas Sewell, NICTA
228 More efficient HOL/record implementation.
230 * September 2009: Sascha Boehme, TUM
231 SMT method using external SMT solvers.
233 * September 2009: Florian Haftmann, TUM
234 Refinement of sets and lattices.
236 * July 2009: Jeremy Avigad and Amine Chaieb
239 * July 2009: Philipp Meyer, TUM
240 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
243 * July 2009: Florian Haftmann, TUM
244 New quickcheck implementation using new code generator.
246 * July 2009: Florian Haftmann, TUM
247 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
250 * June 2009: Florian Haftmann, TUM
251 HOL/Library/Tree: search trees implementing mappings, ready to use
254 * March 2009: Philipp Meyer, TUM
255 Minimization tool for results from Sledgehammer.
258 Contributions to Isabelle2009
259 -----------------------------
261 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
263 Elementary topology in Euclidean space.
265 * March 2009: Johannes Hoelzl, TUM
266 Method "approximation", which proves real valued inequalities by
269 * February 2009: Filip Maric, Univ. of Belgrade
272 * February 2009: Jasmin Christian Blanchette, TUM
273 Misc cleanup of HOL/refute.
275 * February 2009: Timothy Bourke, NICTA
276 New find_consts command.
278 * February 2009: Timothy Bourke, NICTA
279 "solves" criterion for find_theorems and auto_solve option
281 * December 2008: Clemens Ballarin, TUM
282 New locale implementation.
284 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
285 Method "sizechange" for advanced termination proofs.
287 * November 2008: Timothy Bourke, NICTA
288 Performance improvement (factor 50) for find_theorems.
290 * 2008: Florian Haftmann, TUM
291 Various extensions and restructurings in HOL, improvements
292 in evaluation mechanisms, new module binding.ML for name bindings.
294 * October 2008: Fabian Immler, TUM
295 ATP manager for Sledgehammer, based on ML threads instead of Posix
296 processes. Additional ATP wrappers, including remote SystemOnTPTP
299 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
300 Prover for coherent logic.
302 * August 2008: Fabian Immler, TUM
303 Vampire wrapper script for remote SystemOnTPTP service.
306 Contributions to Isabelle2008
307 -----------------------------
310 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
311 HOL library improvements.
313 * 2007/2008: Brian Huffman, PSU
314 HOLCF library improvements.
316 * 2007/2008: Stefan Berghofer, TUM
317 HOL-Nominal package improvements.
319 * March 2008: Markus Reiter, TUM
320 HOL/Library/RBT: red-black trees.
322 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
323 Lukas Bulwahn, TUM and John Matthews, Galois:
324 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
327 * December 2007: Norbert Schirmer, Uni Saarbruecken
328 Misc improvements of record package in HOL.
330 * December 2007: Florian Haftmann, TUM
331 Overloading and class instantiation target.
333 * December 2007: Florian Haftmann, TUM
334 New version of primrec package for local theories.
336 * December 2007: Alexander Krauss, TUM
337 Method "induction_scheme" in HOL.
339 * November 2007: Peter Lammich, Uni Muenster
340 HOL-Lattice: some more lemmas.
343 Contributions to Isabelle2007
344 -----------------------------
346 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
347 State Spaces: The Locale Way (in HOL).
349 * October 2007: Mark A. Hillebrand, DFKI
350 Robust sub/superscripts in LaTeX document output.
352 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
353 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
354 HOL-Word: a library for fixed-size machine words in Isabelle.
356 * August 2007: Brian Huffman, PSU
357 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
359 * June 2007: Amine Chaieb, TUM
360 Semiring normalization and Groebner Bases.
361 Support for dense linear orders.
363 * June 2007: Joe Hurd, Oxford
364 Metis theorem-prover.
366 * 2007: Kong W. Susanto, Cambridge
367 HOL: Metis prover integration.
369 * 2007: Stefan Berghofer, TUM
370 HOL: inductive predicates and sets.
372 * 2007: Norbert Schirmer, TUM
373 HOL/record: misc improvements.
375 * 2006/2007: Alexander Krauss, TUM
376 HOL: function package and related theories on termination.
378 * 2006/2007: Florian Haftmann, TUM
379 Pure: generic code generator framework.
381 HOL: theory reorganization, code generator setup.
383 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
385 HOL/Nominal package and related tools.
387 * November 2006: Lukas Bulwahn, TUM
388 HOL: method "lexicographic_order" for function package.
390 * October 2006: Stefan Hohe, TUM
391 HOL-Algebra: ideals and quotients over rings.
393 * August 2006: Amine Chaieb, TUM
394 Experimental support for generic reflection and reification in HOL.
396 * July 2006: Rafal Kolanski, NICTA
397 Hex (0xFF) and binary (0b1011) numerals.
399 * May 2006: Klaus Aehlig, LMU
400 Command 'normal_form': normalization by evaluation.
402 * May 2006: Amine Chaieb, TUM
403 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
406 * February 2006: Benjamin Porter, NICTA
407 HOL and HOL-Complex: generalised mean value theorem, continuum is
408 not denumerable, harmonic and arithmetic series, and denumerability
411 * October 2005: Martin Wildmoser, TUM
412 Sketch for Isar 'guess' element.
415 Contributions to Isabelle2005
416 -----------------------------
418 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
419 HOL-Complex: Formalization of Taylor series.
421 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
422 Components for SAT solver method using zChaff.
424 * September 2005: Ning Zhang and Christian Urban, LMU Munich
427 * September 2005: Bernhard Haeupler, TUM
428 Method comm_ring for proving equalities in commutative rings.
430 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
431 Various improvements of the HOL and HOL-Complex library.
433 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
434 Some structured proofs about completeness of real numbers.
436 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
437 Improved retrieval of facts from theory/proof context.
439 * February 2005: Lucas Dixon, University of Edinburgh
440 Improved subst method.
442 * 2005: Brian Huffman, OGI
443 Various improvements of HOLCF.
444 Some improvements of the HOL-Complex library.
446 * 2005: Claire Quigley and Jia Meng, University of Cambridge
447 Some support for asynchronous communication with external provers
450 * 2005: Florian Haftmann, TUM
451 Contributions to document 'sugar'.
452 Various ML combinators, notably linear functional transformations.
453 Some cleanup of ML legacy.
454 Additional antiquotations.
455 Improved Isabelle web site.
457 * 2004/2005: David Aspinall, University of Edinburgh
458 Various elements of XML and PGIP based communication with user
459 interfaces (experimental).
461 * 2004/2005: Gerwin Klein, NICTA
462 Contributions to document 'sugar'.
463 Improved Isabelle web site.
464 Improved HTML presentation of theories.
466 * 2004/2005: Clemens Ballarin, TUM
467 Provers: tools for transitive relations and quasi orders.
468 Improved version of locales, notably interpretation of locales.
469 Improved version of HOL-Algebra.
471 * 2004/2005: Amine Chaieb, TUM
472 Improved version of HOL presburger method.
474 * 2004/2005: Steven Obua, TUM
475 Improved version of HOL/Import, support for HOL-Light.
476 Improved version of HOL-Complex-Matrix.
477 Pure/defs: more sophisticated checks on well-formedness of overloading.
478 Pure/Tools: an experimental evaluator for lambda terms.
480 * 2004/2005: Norbert Schirmer, TUM
481 Contributions to document 'sugar'.
482 Improved version of HOL/record.
484 * 2004/2005: Sebastian Skalberg, TUM
485 Improved version of HOL/Import.
486 Some internal ML reorganizations.
488 * 2004/2005: Tjark Weber, TUM
489 SAT solver method using zChaff.
490 Improved version of HOL/refute.