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 * 2013: Florian Haftmann, TUM
10 Reworking and consolidation of code generation for target
14 Contributions to Isabelle2013
15 -----------------------------
17 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
18 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
20 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
21 Jasmin Blanchette, TUM
22 Implemented Machine Learning for Sledgehammer (MaSh).
24 * Fall 2012: Steffen Smolka, TUM
25 Various improvements to Sledgehammer's Isar proof generator,
26 including a smart type annotation algorithm and proof shrinking.
28 * December 2012: Alessandro Coglio, Kestrel
29 Contributions to HOL's Lattice library.
31 * November 2012: Fabian Immler, TUM
32 "Symbols" dockable for Isabelle/jEdit.
34 * November 2012: Fabian Immler, TUM
35 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
36 of projective families.
38 * October 2012: Andreas Lochbihler, KIT
39 Efficient construction of red-black trees from sorted associative
42 * September 2012: Florian Haftmann, TUM
43 Lattice instances for type option.
45 * September 2012: Christian Sternagel, JAIST
46 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
47 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
49 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
50 New BNF-based (co)datatype package.
52 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
53 Theories of ordinals and cardinals.
55 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
56 Advanced support for Isabelle sessions and build management, notably
59 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
60 Simproc for rewriting set comprehensions into pointfree expressions.
62 * May 2012: Andreas Lochbihler, KIT
63 Theory of almost everywhere constant functions.
65 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
66 Graphview in Scala/Swing.
69 Contributions to Isabelle2012
70 -----------------------------
72 * April 2012: Johannes Hölzl, TUM
73 Probability: Introduced type to represent measures instead of
76 * April 2012: Johannes Hölzl, Fabian Immler, TUM
77 Float: Moved to Dyadic rationals to represent floating point numers.
79 * April 2012: Thomas Sewell, NICTA and
80 2010: Sascha Boehme, TUM
81 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
82 equalities/inequalities.
84 * March 2012: Christian Sternagel, JAIST
85 Consolidated theory of relation composition.
87 * March 2012: Nik Sultana, University of Cambridge
88 HOL/TPTP parser and import facilities.
90 * March 2012: Cezary Kaliszyk, University of Innsbruck and
91 Alexander Krauss, QAware GmbH
92 Faster and more scalable Import mechanism for HOL Light proofs.
94 * January 2012: Florian Haftmann, TUM, et al.
95 (Re-)Introduction of the "set" type constructor.
97 * 2012: Ondrej Kuncar, TUM
98 New package Lifting, various improvements and refinements to the
101 * 2011/2012: Jasmin Blanchette, TUM
102 Various improvements to Sledgehammer, notably: tighter integration
103 with SPASS, support for more provers (Alt-Ergo, iProver,
106 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
107 Various refinements of local theory infrastructure.
108 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
111 Contributions to Isabelle2011-1
112 -------------------------------
114 * September 2011: Peter Gammie
115 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
117 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
118 Refined theory on complete lattices.
120 * August 2011: Brian Huffman, Portland State University
121 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
123 * June 2011: Brian Huffman, Portland State University
124 Proof method "countable_datatype" for theory Library/Countable.
126 * 2011: Jasmin Blanchette, TUM
127 Various improvements to Sledgehammer, notably: use of sound
128 translations, support for more provers (Waldmeister, LEO-II,
129 Satallax). Further development of Nitpick and 'try' command.
131 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
132 Theory HOL/Library/Cset_Monad allows do notation for computable sets
133 (cset) via the generic monad ad-hoc overloading facility.
135 * 2011: Johannes Hölzl, Armin Heller, TUM and
136 Bogdan Grechuk, University of Edinburgh
137 Theory HOL/Library/Extended_Reals: real numbers extended with plus
140 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
141 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
145 Contributions to Isabelle2011
146 -----------------------------
148 * January 2011: Stefan Berghofer, secunet Security Networks AG
149 HOL-SPARK: an interactive prover back-end for SPARK.
151 * October 2010: Bogdan Grechuk, University of Edinburgh
152 Extended convex analysis in Multivariate Analysis.
154 * October 2010: Dmitriy Traytel, TUM
155 Coercive subtyping via subtype constraints.
157 * October 2010: Alexander Krauss, TUM
158 Command partial_function for function definitions based on complete
159 partial orders in HOL.
161 * September 2010: Florian Haftmann, TUM
162 Refined concepts for evaluation, i.e., normalization of terms using
163 different techniques.
165 * September 2010: Florian Haftmann, TUM
166 Code generation for Scala.
168 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
169 Improved Probability theory in HOL.
171 * July 2010: Florian Haftmann, TUM
172 Reworking and extension of the Imperative HOL framework.
174 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
176 Ad-hoc overloading. Generic do notation for monads.
179 Contributions to Isabelle2009-2
180 -------------------------------
182 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
183 Makarius Wenzel, TUM / LRI
184 Elimination of type classes from proof terms.
186 * April 2010: Florian Haftmann, TUM
187 Reorganization of abstract algebra type classes.
189 * April 2010: Florian Haftmann, TUM
190 Code generation for data representations involving invariants;
191 various collections avaiable in theories Fset, Dlist, RBT,
192 Mapping and AssocList.
194 * March 2010: Sascha Boehme, TUM
195 Efficient SHA1 library for Poly/ML.
197 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
198 Quotient type package for Isabelle/HOL.
201 Contributions to Isabelle2009-1
202 -------------------------------
204 * November 2009, Brian Huffman, PSU
205 New definitional domain package for HOLCF.
207 * November 2009: Robert Himmelmann, TUM
208 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
210 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
211 A tabled implementation of the reflexive transitive closure.
213 * November 2009: Lukas Bulwahn, TUM
214 Predicate Compiler: a compiler for inductive predicates to
215 equational specifications.
217 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
218 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
220 * October 2009: Jasmin Blanchette, TUM
221 Nitpick: yet another counterexample generator for Isabelle/HOL.
223 * October 2009: Sascha Boehme, TUM
224 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
226 * October 2009: Florian Haftmann, TUM
227 Refinement of parts of the HOL datatype package.
229 * October 2009: Florian Haftmann, TUM
230 Generic term styles for term antiquotations.
232 * September 2009: Thomas Sewell, NICTA
233 More efficient HOL/record implementation.
235 * September 2009: Sascha Boehme, TUM
236 SMT method using external SMT solvers.
238 * September 2009: Florian Haftmann, TUM
239 Refinement of sets and lattices.
241 * July 2009: Jeremy Avigad and Amine Chaieb
244 * July 2009: Philipp Meyer, TUM
245 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
248 * July 2009: Florian Haftmann, TUM
249 New quickcheck implementation using new code generator.
251 * July 2009: Florian Haftmann, TUM
252 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
255 * June 2009: Florian Haftmann, TUM
256 HOL/Library/Tree: search trees implementing mappings, ready to use
259 * March 2009: Philipp Meyer, TUM
260 Minimization tool for results from Sledgehammer.
263 Contributions to Isabelle2009
264 -----------------------------
266 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
268 Elementary topology in Euclidean space.
270 * March 2009: Johannes Hoelzl, TUM
271 Method "approximation", which proves real valued inequalities by
274 * February 2009: Filip Maric, Univ. of Belgrade
277 * February 2009: Jasmin Christian Blanchette, TUM
278 Misc cleanup of HOL/refute.
280 * February 2009: Timothy Bourke, NICTA
281 New find_consts command.
283 * February 2009: Timothy Bourke, NICTA
284 "solves" criterion for find_theorems and auto_solve option
286 * December 2008: Clemens Ballarin, TUM
287 New locale implementation.
289 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
290 Method "sizechange" for advanced termination proofs.
292 * November 2008: Timothy Bourke, NICTA
293 Performance improvement (factor 50) for find_theorems.
295 * 2008: Florian Haftmann, TUM
296 Various extensions and restructurings in HOL, improvements
297 in evaluation mechanisms, new module binding.ML for name bindings.
299 * October 2008: Fabian Immler, TUM
300 ATP manager for Sledgehammer, based on ML threads instead of Posix
301 processes. Additional ATP wrappers, including remote SystemOnTPTP
304 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
305 Prover for coherent logic.
307 * August 2008: Fabian Immler, TUM
308 Vampire wrapper script for remote SystemOnTPTP service.
311 Contributions to Isabelle2008
312 -----------------------------
315 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
316 HOL library improvements.
318 * 2007/2008: Brian Huffman, PSU
319 HOLCF library improvements.
321 * 2007/2008: Stefan Berghofer, TUM
322 HOL-Nominal package improvements.
324 * March 2008: Markus Reiter, TUM
325 HOL/Library/RBT: red-black trees.
327 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
328 Lukas Bulwahn, TUM and John Matthews, Galois:
329 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
332 * December 2007: Norbert Schirmer, Uni Saarbruecken
333 Misc improvements of record package in HOL.
335 * December 2007: Florian Haftmann, TUM
336 Overloading and class instantiation target.
338 * December 2007: Florian Haftmann, TUM
339 New version of primrec package for local theories.
341 * December 2007: Alexander Krauss, TUM
342 Method "induction_scheme" in HOL.
344 * November 2007: Peter Lammich, Uni Muenster
345 HOL-Lattice: some more lemmas.
348 Contributions to Isabelle2007
349 -----------------------------
351 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
352 State Spaces: The Locale Way (in HOL).
354 * October 2007: Mark A. Hillebrand, DFKI
355 Robust sub/superscripts in LaTeX document output.
357 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
358 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
359 HOL-Word: a library for fixed-size machine words in Isabelle.
361 * August 2007: Brian Huffman, PSU
362 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
364 * June 2007: Amine Chaieb, TUM
365 Semiring normalization and Groebner Bases.
366 Support for dense linear orders.
368 * June 2007: Joe Hurd, Oxford
369 Metis theorem-prover.
371 * 2007: Kong W. Susanto, Cambridge
372 HOL: Metis prover integration.
374 * 2007: Stefan Berghofer, TUM
375 HOL: inductive predicates and sets.
377 * 2007: Norbert Schirmer, TUM
378 HOL/record: misc improvements.
380 * 2006/2007: Alexander Krauss, TUM
381 HOL: function package and related theories on termination.
383 * 2006/2007: Florian Haftmann, TUM
384 Pure: generic code generator framework.
386 HOL: theory reorganization, code generator setup.
388 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
390 HOL/Nominal package and related tools.
392 * November 2006: Lukas Bulwahn, TUM
393 HOL: method "lexicographic_order" for function package.
395 * October 2006: Stefan Hohe, TUM
396 HOL-Algebra: ideals and quotients over rings.
398 * August 2006: Amine Chaieb, TUM
399 Experimental support for generic reflection and reification in HOL.
401 * July 2006: Rafal Kolanski, NICTA
402 Hex (0xFF) and binary (0b1011) numerals.
404 * May 2006: Klaus Aehlig, LMU
405 Command 'normal_form': normalization by evaluation.
407 * May 2006: Amine Chaieb, TUM
408 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
411 * February 2006: Benjamin Porter, NICTA
412 HOL and HOL-Complex: generalised mean value theorem, continuum is
413 not denumerable, harmonic and arithmetic series, and denumerability
416 * October 2005: Martin Wildmoser, TUM
417 Sketch for Isar 'guess' element.
420 Contributions to Isabelle2005
421 -----------------------------
423 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
424 HOL-Complex: Formalization of Taylor series.
426 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
427 Components for SAT solver method using zChaff.
429 * September 2005: Ning Zhang and Christian Urban, LMU Munich
432 * September 2005: Bernhard Haeupler, TUM
433 Method comm_ring for proving equalities in commutative rings.
435 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
436 Various improvements of the HOL and HOL-Complex library.
438 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
439 Some structured proofs about completeness of real numbers.
441 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
442 Improved retrieval of facts from theory/proof context.
444 * February 2005: Lucas Dixon, University of Edinburgh
445 Improved subst method.
447 * 2005: Brian Huffman, OGI
448 Various improvements of HOLCF.
449 Some improvements of the HOL-Complex library.
451 * 2005: Claire Quigley and Jia Meng, University of Cambridge
452 Some support for asynchronous communication with external provers
455 * 2005: Florian Haftmann, TUM
456 Contributions to document 'sugar'.
457 Various ML combinators, notably linear functional transformations.
458 Some cleanup of ML legacy.
459 Additional antiquotations.
460 Improved Isabelle web site.
462 * 2004/2005: David Aspinall, University of Edinburgh
463 Various elements of XML and PGIP based communication with user
464 interfaces (experimental).
466 * 2004/2005: Gerwin Klein, NICTA
467 Contributions to document 'sugar'.
468 Improved Isabelle web site.
469 Improved HTML presentation of theories.
471 * 2004/2005: Clemens Ballarin, TUM
472 Provers: tools for transitive relations and quasi orders.
473 Improved version of locales, notably interpretation of locales.
474 Improved version of HOL-Algebra.
476 * 2004/2005: Amine Chaieb, TUM
477 Improved version of HOL presburger method.
479 * 2004/2005: Steven Obua, TUM
480 Improved version of HOL/Import, support for HOL-Light.
481 Improved version of HOL-Complex-Matrix.
482 Pure/defs: more sophisticated checks on well-formedness of overloading.
483 Pure/Tools: an experimental evaluator for lambda terms.
485 * 2004/2005: Norbert Schirmer, TUM
486 Contributions to document 'sugar'.
487 Improved version of HOL/record.
489 * 2004/2005: Sebastian Skalberg, TUM
490 Improved version of HOL/Import.
491 Some internal ML reorganizations.
493 * 2004/2005: Tjark Weber, TUM
494 SAT solver method using zChaff.
495 Improved version of HOL/refute.