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 * April 2013: Stefan Berghofer, secunet Security Networks AG
11 Makarius Wenzel, Université Paris-Sud / LRI
12 Case translations as a separate check phase independent of the
15 * March 2013: Florian Haftmann, TUM
16 Reform of "big operators" on sets.
18 * March 2013: Florian Haftmann, TUM
19 Algebraic locale hierarchy for orderings and (semi)lattices.
21 * Feb. 2013: Florian Haftmann, TUM
22 Reworking and consolidation of code generation for target
25 * Feb. 2013: Florian Haftmann, TUM
26 Sieve of Eratosthenes.
29 Contributions to Isabelle2013
30 -----------------------------
32 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
33 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
35 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
36 Jasmin Blanchette, TUM
37 Implemented Machine Learning for Sledgehammer (MaSh).
39 * Fall 2012: Steffen Smolka, TUM
40 Various improvements to Sledgehammer's Isar proof generator,
41 including a smart type annotation algorithm and proof shrinking.
43 * December 2012: Alessandro Coglio, Kestrel
44 Contributions to HOL's Lattice library.
46 * November 2012: Fabian Immler, TUM
47 "Symbols" dockable for Isabelle/jEdit.
49 * November 2012: Fabian Immler, TUM
50 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
51 of projective families.
53 * October 2012: Andreas Lochbihler, KIT
54 Efficient construction of red-black trees from sorted associative
57 * September 2012: Florian Haftmann, TUM
58 Lattice instances for type option.
60 * September 2012: Christian Sternagel, JAIST
61 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
62 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
64 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
65 New BNF-based (co)datatype package.
67 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
68 Theories of ordinals and cardinals.
70 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
71 Advanced support for Isabelle sessions and build management, notably
74 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
75 Simproc for rewriting set comprehensions into pointfree expressions.
77 * May 2012: Andreas Lochbihler, KIT
78 Theory of almost everywhere constant functions.
80 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
81 Graphview in Scala/Swing.
84 Contributions to Isabelle2012
85 -----------------------------
87 * April 2012: Johannes Hölzl, TUM
88 Probability: Introduced type to represent measures instead of
91 * April 2012: Johannes Hölzl, Fabian Immler, TUM
92 Float: Moved to Dyadic rationals to represent floating point numers.
94 * April 2012: Thomas Sewell, NICTA and
95 2010: Sascha Boehme, TUM
96 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
97 equalities/inequalities.
99 * March 2012: Christian Sternagel, JAIST
100 Consolidated theory of relation composition.
102 * March 2012: Nik Sultana, University of Cambridge
103 HOL/TPTP parser and import facilities.
105 * March 2012: Cezary Kaliszyk, University of Innsbruck and
106 Alexander Krauss, QAware GmbH
107 Faster and more scalable Import mechanism for HOL Light proofs.
109 * January 2012: Florian Haftmann, TUM, et al.
110 (Re-)Introduction of the "set" type constructor.
112 * 2012: Ondrej Kuncar, TUM
113 New package Lifting, various improvements and refinements to the
116 * 2011/2012: Jasmin Blanchette, TUM
117 Various improvements to Sledgehammer, notably: tighter integration
118 with SPASS, support for more provers (Alt-Ergo, iProver,
121 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
122 Various refinements of local theory infrastructure.
123 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
126 Contributions to Isabelle2011-1
127 -------------------------------
129 * September 2011: Peter Gammie
130 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
132 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
133 Refined theory on complete lattices.
135 * August 2011: Brian Huffman, Portland State University
136 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
138 * June 2011: Brian Huffman, Portland State University
139 Proof method "countable_datatype" for theory Library/Countable.
141 * 2011: Jasmin Blanchette, TUM
142 Various improvements to Sledgehammer, notably: use of sound
143 translations, support for more provers (Waldmeister, LEO-II,
144 Satallax). Further development of Nitpick and 'try' command.
146 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
147 Theory HOL/Library/Cset_Monad allows do notation for computable sets
148 (cset) via the generic monad ad-hoc overloading facility.
150 * 2011: Johannes Hölzl, Armin Heller, TUM and
151 Bogdan Grechuk, University of Edinburgh
152 Theory HOL/Library/Extended_Reals: real numbers extended with plus
155 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
156 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
160 Contributions to Isabelle2011
161 -----------------------------
163 * January 2011: Stefan Berghofer, secunet Security Networks AG
164 HOL-SPARK: an interactive prover back-end for SPARK.
166 * October 2010: Bogdan Grechuk, University of Edinburgh
167 Extended convex analysis in Multivariate Analysis.
169 * October 2010: Dmitriy Traytel, TUM
170 Coercive subtyping via subtype constraints.
172 * October 2010: Alexander Krauss, TUM
173 Command partial_function for function definitions based on complete
174 partial orders in HOL.
176 * September 2010: Florian Haftmann, TUM
177 Refined concepts for evaluation, i.e., normalization of terms using
178 different techniques.
180 * September 2010: Florian Haftmann, TUM
181 Code generation for Scala.
183 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
184 Improved Probability theory in HOL.
186 * July 2010: Florian Haftmann, TUM
187 Reworking and extension of the Imperative HOL framework.
189 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
191 Ad-hoc overloading. Generic do notation for monads.
194 Contributions to Isabelle2009-2
195 -------------------------------
197 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
198 Makarius Wenzel, TUM / LRI
199 Elimination of type classes from proof terms.
201 * April 2010: Florian Haftmann, TUM
202 Reorganization of abstract algebra type classes.
204 * April 2010: Florian Haftmann, TUM
205 Code generation for data representations involving invariants;
206 various collections avaiable in theories Fset, Dlist, RBT,
207 Mapping and AssocList.
209 * March 2010: Sascha Boehme, TUM
210 Efficient SHA1 library for Poly/ML.
212 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
213 Quotient type package for Isabelle/HOL.
216 Contributions to Isabelle2009-1
217 -------------------------------
219 * November 2009, Brian Huffman, PSU
220 New definitional domain package for HOLCF.
222 * November 2009: Robert Himmelmann, TUM
223 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
225 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
226 A tabled implementation of the reflexive transitive closure.
228 * November 2009: Lukas Bulwahn, TUM
229 Predicate Compiler: a compiler for inductive predicates to
230 equational specifications.
232 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
233 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
235 * October 2009: Jasmin Blanchette, TUM
236 Nitpick: yet another counterexample generator for Isabelle/HOL.
238 * October 2009: Sascha Boehme, TUM
239 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
241 * October 2009: Florian Haftmann, TUM
242 Refinement of parts of the HOL datatype package.
244 * October 2009: Florian Haftmann, TUM
245 Generic term styles for term antiquotations.
247 * September 2009: Thomas Sewell, NICTA
248 More efficient HOL/record implementation.
250 * September 2009: Sascha Boehme, TUM
251 SMT method using external SMT solvers.
253 * September 2009: Florian Haftmann, TUM
254 Refinement of sets and lattices.
256 * July 2009: Jeremy Avigad and Amine Chaieb
259 * July 2009: Philipp Meyer, TUM
260 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
263 * July 2009: Florian Haftmann, TUM
264 New quickcheck implementation using new code generator.
266 * July 2009: Florian Haftmann, TUM
267 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
270 * June 2009: Florian Haftmann, TUM
271 HOL/Library/Tree: search trees implementing mappings, ready to use
274 * March 2009: Philipp Meyer, TUM
275 Minimization tool for results from Sledgehammer.
278 Contributions to Isabelle2009
279 -----------------------------
281 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
283 Elementary topology in Euclidean space.
285 * March 2009: Johannes Hoelzl, TUM
286 Method "approximation", which proves real valued inequalities by
289 * February 2009: Filip Maric, Univ. of Belgrade
292 * February 2009: Jasmin Christian Blanchette, TUM
293 Misc cleanup of HOL/refute.
295 * February 2009: Timothy Bourke, NICTA
296 New find_consts command.
298 * February 2009: Timothy Bourke, NICTA
299 "solves" criterion for find_theorems and auto_solve option
301 * December 2008: Clemens Ballarin, TUM
302 New locale implementation.
304 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
305 Method "sizechange" for advanced termination proofs.
307 * November 2008: Timothy Bourke, NICTA
308 Performance improvement (factor 50) for find_theorems.
310 * 2008: Florian Haftmann, TUM
311 Various extensions and restructurings in HOL, improvements
312 in evaluation mechanisms, new module binding.ML for name bindings.
314 * October 2008: Fabian Immler, TUM
315 ATP manager for Sledgehammer, based on ML threads instead of Posix
316 processes. Additional ATP wrappers, including remote SystemOnTPTP
319 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
320 Prover for coherent logic.
322 * August 2008: Fabian Immler, TUM
323 Vampire wrapper script for remote SystemOnTPTP service.
326 Contributions to Isabelle2008
327 -----------------------------
330 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
331 HOL library improvements.
333 * 2007/2008: Brian Huffman, PSU
334 HOLCF library improvements.
336 * 2007/2008: Stefan Berghofer, TUM
337 HOL-Nominal package improvements.
339 * March 2008: Markus Reiter, TUM
340 HOL/Library/RBT: red-black trees.
342 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
343 Lukas Bulwahn, TUM and John Matthews, Galois:
344 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
347 * December 2007: Norbert Schirmer, Uni Saarbruecken
348 Misc improvements of record package in HOL.
350 * December 2007: Florian Haftmann, TUM
351 Overloading and class instantiation target.
353 * December 2007: Florian Haftmann, TUM
354 New version of primrec package for local theories.
356 * December 2007: Alexander Krauss, TUM
357 Method "induction_scheme" in HOL.
359 * November 2007: Peter Lammich, Uni Muenster
360 HOL-Lattice: some more lemmas.
363 Contributions to Isabelle2007
364 -----------------------------
366 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
367 State Spaces: The Locale Way (in HOL).
369 * October 2007: Mark A. Hillebrand, DFKI
370 Robust sub/superscripts in LaTeX document output.
372 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
373 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
374 HOL-Word: a library for fixed-size machine words in Isabelle.
376 * August 2007: Brian Huffman, PSU
377 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
379 * June 2007: Amine Chaieb, TUM
380 Semiring normalization and Groebner Bases.
381 Support for dense linear orders.
383 * June 2007: Joe Hurd, Oxford
384 Metis theorem-prover.
386 * 2007: Kong W. Susanto, Cambridge
387 HOL: Metis prover integration.
389 * 2007: Stefan Berghofer, TUM
390 HOL: inductive predicates and sets.
392 * 2007: Norbert Schirmer, TUM
393 HOL/record: misc improvements.
395 * 2006/2007: Alexander Krauss, TUM
396 HOL: function package and related theories on termination.
398 * 2006/2007: Florian Haftmann, TUM
399 Pure: generic code generator framework.
401 HOL: theory reorganization, code generator setup.
403 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
405 HOL/Nominal package and related tools.
407 * November 2006: Lukas Bulwahn, TUM
408 HOL: method "lexicographic_order" for function package.
410 * October 2006: Stefan Hohe, TUM
411 HOL-Algebra: ideals and quotients over rings.
413 * August 2006: Amine Chaieb, TUM
414 Experimental support for generic reflection and reification in HOL.
416 * July 2006: Rafal Kolanski, NICTA
417 Hex (0xFF) and binary (0b1011) numerals.
419 * May 2006: Klaus Aehlig, LMU
420 Command 'normal_form': normalization by evaluation.
422 * May 2006: Amine Chaieb, TUM
423 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
426 * February 2006: Benjamin Porter, NICTA
427 HOL and HOL-Complex: generalised mean value theorem, continuum is
428 not denumerable, harmonic and arithmetic series, and denumerability
431 * October 2005: Martin Wildmoser, TUM
432 Sketch for Isar 'guess' element.
435 Contributions to Isabelle2005
436 -----------------------------
438 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
439 HOL-Complex: Formalization of Taylor series.
441 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
442 Components for SAT solver method using zChaff.
444 * September 2005: Ning Zhang and Christian Urban, LMU Munich
447 * September 2005: Bernhard Haeupler, TUM
448 Method comm_ring for proving equalities in commutative rings.
450 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
451 Various improvements of the HOL and HOL-Complex library.
453 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
454 Some structured proofs about completeness of real numbers.
456 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
457 Improved retrieval of facts from theory/proof context.
459 * February 2005: Lucas Dixon, University of Edinburgh
460 Improved subst method.
462 * 2005: Brian Huffman, OGI
463 Various improvements of HOLCF.
464 Some improvements of the HOL-Complex library.
466 * 2005: Claire Quigley and Jia Meng, University of Cambridge
467 Some support for asynchronous communication with external provers
470 * 2005: Florian Haftmann, TUM
471 Contributions to document 'sugar'.
472 Various ML combinators, notably linear functional transformations.
473 Some cleanup of ML legacy.
474 Additional antiquotations.
475 Improved Isabelle web site.
477 * 2004/2005: David Aspinall, University of Edinburgh
478 Various elements of XML and PGIP based communication with user
479 interfaces (experimental).
481 * 2004/2005: Gerwin Klein, NICTA
482 Contributions to document 'sugar'.
483 Improved Isabelle web site.
484 Improved HTML presentation of theories.
486 * 2004/2005: Clemens Ballarin, TUM
487 Provers: tools for transitive relations and quasi orders.
488 Improved version of locales, notably interpretation of locales.
489 Improved version of HOL-Algebra.
491 * 2004/2005: Amine Chaieb, TUM
492 Improved version of HOL presburger method.
494 * 2004/2005: Steven Obua, TUM
495 Improved version of HOL/Import, support for HOL-Light.
496 Improved version of HOL-Complex-Matrix.
497 Pure/defs: more sophisticated checks on well-formedness of overloading.
498 Pure/Tools: an experimental evaluator for lambda terms.
500 * 2004/2005: Norbert Schirmer, TUM
501 Contributions to document 'sugar'.
502 Improved version of HOL/record.
504 * 2004/2005: Sebastian Skalberg, TUM
505 Improved version of HOL/Import.
506 Some internal ML reorganizations.
508 * 2004/2005: Tjark Weber, TUM
509 SAT solver method using zChaff.
510 Improved version of HOL/refute.