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 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
10 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
12 * Fall 2012: Daniel Kuehlwein, ICIS, Radboud University Nijmegen
13 Jasmin Blanchette, TUM
14 Implemented Machine Learning for Sledgehammer (MaSh).
16 * Fall 2012: Steffen Smolka, TUM
17 Various improvements to Sledgehammer's Isar proof generator, including
18 a smart type annotation algorithm and proof shrinking.
20 * November 2012: Fabian Immler, TUM
21 "Symbols" dockable for Isabelle/jEdit.
23 * November 2012: Fabian Immler, TUM
24 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
25 of projective families.
27 * October 2012: Andreas Lochbihler, KIT
28 Efficient construction of red-black trees from sorted associative
31 * September 2012: Florian Haftmann, TUM
32 Lattice instances for type option.
34 * September 2012: Christian Sternagel, JAIST
35 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
36 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
38 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
39 New BNF-based (co)datatype package.
41 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
42 Theories of ordinals and cardinals.
44 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
45 Advanced support for Isabelle sessions and build management, notably
48 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
49 Simproc for rewriting set comprehensions into pointfree expressions.
51 * May 2012: Andreas Lochbihler, KIT
52 Theory of almost everywhere constant functions.
54 Contributions to Isabelle2012
55 -----------------------------
57 * April 2012: Johannes Hölzl, TUM
58 Probability: Introduced type to represent measures instead of
61 * April 2012: Johannes Hölzl, Fabian Immler, TUM
62 Float: Moved to Dyadic rationals to represent floating point numers.
64 * April 2012: Thomas Sewell, NICTA and
65 2010: Sascha Boehme, TUM
66 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
67 equalities/inequalities.
69 * March 2012: Christian Sternagel, JAIST
70 Consolidated theory of relation composition.
72 * March 2012: Nik Sultana, University of Cambridge
73 HOL/TPTP parser and import facilities.
75 * March 2012: Cezary Kaliszyk, University of Innsbruck and
76 Alexander Krauss, QAware GmbH
77 Faster and more scalable Import mechanism for HOL Light proofs.
79 * January 2012: Florian Haftmann, TUM, et al.
80 (Re-)Introduction of the "set" type constructor.
82 * 2012: Ondrej Kuncar, TUM
83 New package Lifting, various improvements and refinements to the
86 * 2011/2012: Jasmin Blanchette, TUM
87 Various improvements to Sledgehammer, notably: tighter integration
88 with SPASS, support for more provers (Alt-Ergo, iProver,
91 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
92 Various refinements of local theory infrastructure.
93 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
96 Contributions to Isabelle2011-1
97 -------------------------------
99 * September 2011: Peter Gammie
100 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
102 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
103 Refined theory on complete lattices.
105 * August 2011: Brian Huffman, Portland State University
106 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
108 * June 2011: Brian Huffman, Portland State University
109 Proof method "countable_datatype" for theory Library/Countable.
111 * 2011: Jasmin Blanchette, TUM
112 Various improvements to Sledgehammer, notably: use of sound
113 translations, support for more provers (Waldmeister, LEO-II,
114 Satallax). Further development of Nitpick and 'try' command.
116 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
117 Theory HOL/Library/Cset_Monad allows do notation for computable sets
118 (cset) via the generic monad ad-hoc overloading facility.
120 * 2011: Johannes Hölzl, Armin Heller, TUM and
121 Bogdan Grechuk, University of Edinburgh
122 Theory HOL/Library/Extended_Reals: real numbers extended with plus
125 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
126 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
130 Contributions to Isabelle2011
131 -----------------------------
133 * January 2011: Stefan Berghofer, secunet Security Networks AG
134 HOL-SPARK: an interactive prover back-end for SPARK.
136 * October 2010: Bogdan Grechuk, University of Edinburgh
137 Extended convex analysis in Multivariate Analysis.
139 * October 2010: Dmitriy Traytel, TUM
140 Coercive subtyping via subtype constraints.
142 * October 2010: Alexander Krauss, TUM
143 Command partial_function for function definitions based on complete
144 partial orders in HOL.
146 * September 2010: Florian Haftmann, TUM
147 Refined concepts for evaluation, i.e., normalization of terms using
148 different techniques.
150 * September 2010: Florian Haftmann, TUM
151 Code generation for Scala.
153 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
154 Improved Probability theory in HOL.
156 * July 2010: Florian Haftmann, TUM
157 Reworking and extension of the Imperative HOL framework.
159 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
161 Ad-hoc overloading. Generic do notation for monads.
164 Contributions to Isabelle2009-2
165 -------------------------------
167 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
168 Makarius Wenzel, TUM / LRI
169 Elimination of type classes from proof terms.
171 * April 2010: Florian Haftmann, TUM
172 Reorganization of abstract algebra type classes.
174 * April 2010: Florian Haftmann, TUM
175 Code generation for data representations involving invariants;
176 various collections avaiable in theories Fset, Dlist, RBT,
177 Mapping and AssocList.
179 * March 2010: Sascha Boehme, TUM
180 Efficient SHA1 library for Poly/ML.
182 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
183 Quotient type package for Isabelle/HOL.
186 Contributions to Isabelle2009-1
187 -------------------------------
189 * November 2009, Brian Huffman, PSU
190 New definitional domain package for HOLCF.
192 * November 2009: Robert Himmelmann, TUM
193 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
195 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
196 A tabled implementation of the reflexive transitive closure.
198 * November 2009: Lukas Bulwahn, TUM
199 Predicate Compiler: a compiler for inductive predicates to
200 equational specifications.
202 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
203 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
205 * October 2009: Jasmin Blanchette, TUM
206 Nitpick: yet another counterexample generator for Isabelle/HOL.
208 * October 2009: Sascha Boehme, TUM
209 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
211 * October 2009: Florian Haftmann, TUM
212 Refinement of parts of the HOL datatype package.
214 * October 2009: Florian Haftmann, TUM
215 Generic term styles for term antiquotations.
217 * September 2009: Thomas Sewell, NICTA
218 More efficient HOL/record implementation.
220 * September 2009: Sascha Boehme, TUM
221 SMT method using external SMT solvers.
223 * September 2009: Florian Haftmann, TUM
224 Refinement of sets and lattices.
226 * July 2009: Jeremy Avigad and Amine Chaieb
229 * July 2009: Philipp Meyer, TUM
230 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
233 * July 2009: Florian Haftmann, TUM
234 New quickcheck implementation using new code generator.
236 * July 2009: Florian Haftmann, TUM
237 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
240 * June 2009: Florian Haftmann, TUM
241 HOL/Library/Tree: search trees implementing mappings, ready to use
244 * March 2009: Philipp Meyer, TUM
245 Minimization tool for results from Sledgehammer.
248 Contributions to Isabelle2009
249 -----------------------------
251 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
253 Elementary topology in Euclidean space.
255 * March 2009: Johannes Hoelzl, TUM
256 Method "approximation", which proves real valued inequalities by
259 * February 2009: Filip Maric, Univ. of Belgrade
262 * February 2009: Jasmin Christian Blanchette, TUM
263 Misc cleanup of HOL/refute.
265 * February 2009: Timothy Bourke, NICTA
266 New find_consts command.
268 * February 2009: Timothy Bourke, NICTA
269 "solves" criterion for find_theorems and auto_solve option
271 * December 2008: Clemens Ballarin, TUM
272 New locale implementation.
274 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
275 Method "sizechange" for advanced termination proofs.
277 * November 2008: Timothy Bourke, NICTA
278 Performance improvement (factor 50) for find_theorems.
280 * 2008: Florian Haftmann, TUM
281 Various extensions and restructurings in HOL, improvements
282 in evaluation mechanisms, new module binding.ML for name bindings.
284 * October 2008: Fabian Immler, TUM
285 ATP manager for Sledgehammer, based on ML threads instead of Posix
286 processes. Additional ATP wrappers, including remote SystemOnTPTP
289 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
290 Prover for coherent logic.
292 * August 2008: Fabian Immler, TUM
293 Vampire wrapper script for remote SystemOnTPTP service.
296 Contributions to Isabelle2008
297 -----------------------------
300 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
301 HOL library improvements.
303 * 2007/2008: Brian Huffman, PSU
304 HOLCF library improvements.
306 * 2007/2008: Stefan Berghofer, TUM
307 HOL-Nominal package improvements.
309 * March 2008: Markus Reiter, TUM
310 HOL/Library/RBT: red-black trees.
312 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
313 Lukas Bulwahn, TUM and John Matthews, Galois:
314 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
317 * December 2007: Norbert Schirmer, Uni Saarbruecken
318 Misc improvements of record package in HOL.
320 * December 2007: Florian Haftmann, TUM
321 Overloading and class instantiation target.
323 * December 2007: Florian Haftmann, TUM
324 New version of primrec package for local theories.
326 * December 2007: Alexander Krauss, TUM
327 Method "induction_scheme" in HOL.
329 * November 2007: Peter Lammich, Uni Muenster
330 HOL-Lattice: some more lemmas.
333 Contributions to Isabelle2007
334 -----------------------------
336 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
337 State Spaces: The Locale Way (in HOL).
339 * October 2007: Mark A. Hillebrand, DFKI
340 Robust sub/superscripts in LaTeX document output.
342 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
343 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
344 HOL-Word: a library for fixed-size machine words in Isabelle.
346 * August 2007: Brian Huffman, PSU
347 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
349 * June 2007: Amine Chaieb, TUM
350 Semiring normalization and Groebner Bases.
351 Support for dense linear orders.
353 * June 2007: Joe Hurd, Oxford
354 Metis theorem-prover.
356 * 2007: Kong W. Susanto, Cambridge
357 HOL: Metis prover integration.
359 * 2007: Stefan Berghofer, TUM
360 HOL: inductive predicates and sets.
362 * 2007: Norbert Schirmer, TUM
363 HOL/record: misc improvements.
365 * 2006/2007: Alexander Krauss, TUM
366 HOL: function package and related theories on termination.
368 * 2006/2007: Florian Haftmann, TUM
369 Pure: generic code generator framework.
371 HOL: theory reorganization, code generator setup.
373 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
375 HOL/Nominal package and related tools.
377 * November 2006: Lukas Bulwahn, TUM
378 HOL: method "lexicographic_order" for function package.
380 * October 2006: Stefan Hohe, TUM
381 HOL-Algebra: ideals and quotients over rings.
383 * August 2006: Amine Chaieb, TUM
384 Experimental support for generic reflection and reification in HOL.
386 * July 2006: Rafal Kolanski, NICTA
387 Hex (0xFF) and binary (0b1011) numerals.
389 * May 2006: Klaus Aehlig, LMU
390 Command 'normal_form': normalization by evaluation.
392 * May 2006: Amine Chaieb, TUM
393 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
396 * February 2006: Benjamin Porter, NICTA
397 HOL and HOL-Complex: generalised mean value theorem, continuum is
398 not denumerable, harmonic and arithmetic series, and denumerability
401 * October 2005: Martin Wildmoser, TUM
402 Sketch for Isar 'guess' element.
405 Contributions to Isabelle2005
406 -----------------------------
408 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
409 HOL-Complex: Formalization of Taylor series.
411 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
412 Components for SAT solver method using zChaff.
414 * September 2005: Ning Zhang and Christian Urban, LMU Munich
417 * September 2005: Bernhard Haeupler, TUM
418 Method comm_ring for proving equalities in commutative rings.
420 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
421 Various improvements of the HOL and HOL-Complex library.
423 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
424 Some structured proofs about completeness of real numbers.
426 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
427 Improved retrieval of facts from theory/proof context.
429 * February 2005: Lucas Dixon, University of Edinburgh
430 Improved subst method.
432 * 2005: Brian Huffman, OGI
433 Various improvements of HOLCF.
434 Some improvements of the HOL-Complex library.
436 * 2005: Claire Quigley and Jia Meng, University of Cambridge
437 Some support for asynchronous communication with external provers
440 * 2005: Florian Haftmann, TUM
441 Contributions to document 'sugar'.
442 Various ML combinators, notably linear functional transformations.
443 Some cleanup of ML legacy.
444 Additional antiquotations.
445 Improved Isabelle web site.
447 * 2004/2005: David Aspinall, University of Edinburgh
448 Various elements of XML and PGIP based communication with user
449 interfaces (experimental).
451 * 2004/2005: Gerwin Klein, NICTA
452 Contributions to document 'sugar'.
453 Improved Isabelle web site.
454 Improved HTML presentation of theories.
456 * 2004/2005: Clemens Ballarin, TUM
457 Provers: tools for transitive relations and quasi orders.
458 Improved version of locales, notably interpretation of locales.
459 Improved version of HOL-Algebra.
461 * 2004/2005: Amine Chaieb, TUM
462 Improved version of HOL presburger method.
464 * 2004/2005: Steven Obua, TUM
465 Improved version of HOL/Import, support for HOL-Light.
466 Improved version of HOL-Complex-Matrix.
467 Pure/defs: more sophisticated checks on well-formedness of overloading.
468 Pure/Tools: an experimental evaluator for lambda terms.
470 * 2004/2005: Norbert Schirmer, TUM
471 Contributions to document 'sugar'.
472 Improved version of HOL/record.
474 * 2004/2005: Sebastian Skalberg, TUM
475 Improved version of HOL/Import.
476 Some internal ML reorganizations.
478 * 2004/2005: Tjark Weber, TUM
479 SAT solver method using zChaff.
480 Improved version of HOL/refute.