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 Isabelle2012
7 -----------------------------
9 * April 2012: Thomas Sewell, NICTA
10 (based on work done with Sascha Boehme, TUM in 2010)
11 WordBitwise: logic/circuit expansion of bitvector equalities/inequalities.
13 * March 2012: Christian Sternagel, Japan Advanced Institute of Science
15 Consolidated theory of relation composition.
17 * March 2012: Nik Sultana, University of Cambridge
18 HOL/TPTP parser and import facilities.
20 * March 2012: Cezary Kaliszyk, University of Innsbruck and
21 Alexander Krauss, QAware GmbH
22 Faster and more scalable Import mechanism for HOL Light proofs.
24 * January 2012: Florian Haftmann, TUM, et al.
25 (Re-)Introduction of the "set" type constructor.
27 * 2011/2012: Jasmin Blanchette, TUM
28 Various improvements to Sledgehammer, notably: tighter integration
29 with SPASS, support for more provers (Alt-Ergo, iProver, iProver-Eq).
31 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
32 Various refinements of local theory infrastructure.
33 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
36 Contributions to Isabelle2011-1
37 -------------------------------
39 * September 2011: Peter Gammie
40 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
42 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
43 Refined theory on complete lattices.
45 * August 2011: Brian Huffman, Portland State University
46 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
48 * June 2011: Brian Huffman, Portland State University
49 Proof method "countable_datatype" for theory Library/Countable.
51 * 2011: Jasmin Blanchette, TUM
52 Various improvements to Sledgehammer, notably: use of sound
53 translations, support for more provers (Waldmeister, LEO-II,
54 Satallax). Further development of Nitpick and 'try' command.
56 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
57 Theory HOL/Library/Cset_Monad allows do notation for computable sets
58 (cset) via the generic monad ad-hoc overloading facility.
60 * 2011: Johannes Hölzl, Armin Heller, TUM and
61 Bogdan Grechuk, University of Edinburgh
62 Theory HOL/Library/Extended_Reals: real numbers extended with plus
65 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
66 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
70 Contributions to Isabelle2011
71 -----------------------------
73 * January 2011: Stefan Berghofer, secunet Security Networks AG
74 HOL-SPARK: an interactive prover back-end for SPARK.
76 * October 2010: Bogdan Grechuk, University of Edinburgh
77 Extended convex analysis in Multivariate Analysis.
79 * October 2010: Dmitriy Traytel, TUM
80 Coercive subtyping via subtype constraints.
82 * October 2010: Alexander Krauss, TUM
83 Command partial_function for function definitions based on complete
84 partial orders in HOL.
86 * September 2010: Florian Haftmann, TUM
87 Refined concepts for evaluation, i.e., normalization of terms using
90 * September 2010: Florian Haftmann, TUM
91 Code generation for Scala.
93 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
94 Improved Probability theory in HOL.
96 * July 2010: Florian Haftmann, TUM
97 Reworking and extension of the Imperative HOL framework.
99 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
101 Ad-hoc overloading. Generic do notation for monads.
104 Contributions to Isabelle2009-2
105 -------------------------------
107 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
108 Makarius Wenzel, TUM / LRI
109 Elimination of type classes from proof terms.
111 * April 2010: Florian Haftmann, TUM
112 Reorganization of abstract algebra type classes.
114 * April 2010: Florian Haftmann, TUM
115 Code generation for data representations involving invariants;
116 various collections avaiable in theories Fset, Dlist, RBT,
117 Mapping and AssocList.
119 * March 2010: Sascha Boehme, TUM
120 Efficient SHA1 library for Poly/ML.
122 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
123 Quotient type package for Isabelle/HOL.
126 Contributions to Isabelle2009-1
127 -------------------------------
129 * November 2009, Brian Huffman, PSU
130 New definitional domain package for HOLCF.
132 * November 2009: Robert Himmelmann, TUM
133 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
135 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
136 A tabled implementation of the reflexive transitive closure.
138 * November 2009: Lukas Bulwahn, TUM
139 Predicate Compiler: a compiler for inductive predicates to
140 equational specifications.
142 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
143 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
145 * October 2009: Jasmin Blanchette, TUM
146 Nitpick: yet another counterexample generator for Isabelle/HOL.
148 * October 2009: Sascha Boehme, TUM
149 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
151 * October 2009: Florian Haftmann, TUM
152 Refinement of parts of the HOL datatype package.
154 * October 2009: Florian Haftmann, TUM
155 Generic term styles for term antiquotations.
157 * September 2009: Thomas Sewell, NICTA
158 More efficient HOL/record implementation.
160 * September 2009: Sascha Boehme, TUM
161 SMT method using external SMT solvers.
163 * September 2009: Florian Haftmann, TUM
164 Refinement of sets and lattices.
166 * July 2009: Jeremy Avigad and Amine Chaieb
169 * July 2009: Philipp Meyer, TUM
170 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
173 * July 2009: Florian Haftmann, TUM
174 New quickcheck implementation using new code generator.
176 * July 2009: Florian Haftmann, TUM
177 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
180 * June 2009: Florian Haftmann, TUM
181 HOL/Library/Tree: search trees implementing mappings, ready to use
184 * March 2009: Philipp Meyer, TUM
185 Minimization tool for results from Sledgehammer.
188 Contributions to Isabelle2009
189 -----------------------------
191 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
193 Elementary topology in Euclidean space.
195 * March 2009: Johannes Hoelzl, TUM
196 Method "approximation", which proves real valued inequalities by
199 * February 2009: Filip Maric, Univ. of Belgrade
202 * February 2009: Jasmin Christian Blanchette, TUM
203 Misc cleanup of HOL/refute.
205 * February 2009: Timothy Bourke, NICTA
206 New find_consts command.
208 * February 2009: Timothy Bourke, NICTA
209 "solves" criterion for find_theorems and auto_solve option
211 * December 2008: Clemens Ballarin, TUM
212 New locale implementation.
214 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
215 Method "sizechange" for advanced termination proofs.
217 * November 2008: Timothy Bourke, NICTA
218 Performance improvement (factor 50) for find_theorems.
220 * 2008: Florian Haftmann, TUM
221 Various extensions and restructurings in HOL, improvements
222 in evaluation mechanisms, new module binding.ML for name bindings.
224 * October 2008: Fabian Immler, TUM
225 ATP manager for Sledgehammer, based on ML threads instead of Posix
226 processes. Additional ATP wrappers, including remote SystemOnTPTP
229 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
230 Prover for coherent logic.
232 * August 2008: Fabian Immler, TUM
233 Vampire wrapper script for remote SystemOnTPTP service.
236 Contributions to Isabelle2008
237 -----------------------------
240 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
241 HOL library improvements.
243 * 2007/2008: Brian Huffman, PSU
244 HOLCF library improvements.
246 * 2007/2008: Stefan Berghofer, TUM
247 HOL-Nominal package improvements.
249 * March 2008: Markus Reiter, TUM
250 HOL/Library/RBT: red-black trees.
252 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
253 Lukas Bulwahn, TUM and John Matthews, Galois:
254 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
257 * December 2007: Norbert Schirmer, Uni Saarbruecken
258 Misc improvements of record package in HOL.
260 * December 2007: Florian Haftmann, TUM
261 Overloading and class instantiation target.
263 * December 2007: Florian Haftmann, TUM
264 New version of primrec package for local theories.
266 * December 2007: Alexander Krauss, TUM
267 Method "induction_scheme" in HOL.
269 * November 2007: Peter Lammich, Uni Muenster
270 HOL-Lattice: some more lemmas.
273 Contributions to Isabelle2007
274 -----------------------------
276 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
277 State Spaces: The Locale Way (in HOL).
279 * October 2007: Mark A. Hillebrand, DFKI
280 Robust sub/superscripts in LaTeX document output.
282 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
283 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
284 HOL-Word: a library for fixed-size machine words in Isabelle.
286 * August 2007: Brian Huffman, PSU
287 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
289 * June 2007: Amine Chaieb, TUM
290 Semiring normalization and Groebner Bases.
291 Support for dense linear orders.
293 * June 2007: Joe Hurd, Oxford
294 Metis theorem-prover.
296 * 2007: Kong W. Susanto, Cambridge
297 HOL: Metis prover integration.
299 * 2007: Stefan Berghofer, TUM
300 HOL: inductive predicates and sets.
302 * 2007: Norbert Schirmer, TUM
303 HOL/record: misc improvements.
305 * 2006/2007: Alexander Krauss, TUM
306 HOL: function package and related theories on termination.
308 * 2006/2007: Florian Haftmann, TUM
309 Pure: generic code generator framework.
311 HOL: theory reorganization, code generator setup.
313 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
315 HOL/Nominal package and related tools.
317 * November 2006: Lukas Bulwahn, TUM
318 HOL: method "lexicographic_order" for function package.
320 * October 2006: Stefan Hohe, TUM
321 HOL-Algebra: ideals and quotients over rings.
323 * August 2006: Amine Chaieb, TUM
324 Experimental support for generic reflection and reification in HOL.
326 * July 2006: Rafal Kolanski, NICTA
327 Hex (0xFF) and binary (0b1011) numerals.
329 * May 2006: Klaus Aehlig, LMU
330 Command 'normal_form': normalization by evaluation.
332 * May 2006: Amine Chaieb, TUM
333 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
336 * February 2006: Benjamin Porter, NICTA
337 HOL and HOL-Complex: generalised mean value theorem, continuum is
338 not denumerable, harmonic and arithmetic series, and denumerability
341 * October 2005: Martin Wildmoser, TUM
342 Sketch for Isar 'guess' element.
345 Contributions to Isabelle2005
346 -----------------------------
348 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
349 HOL-Complex: Formalization of Taylor series.
351 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
352 Components for SAT solver method using zChaff.
354 * September 2005: Ning Zhang and Christian Urban, LMU Munich
357 * September 2005: Bernhard Haeupler, TUM
358 Method comm_ring for proving equalities in commutative rings.
360 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
361 Various improvements of the HOL and HOL-Complex library.
363 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
364 Some structured proofs about completeness of real numbers.
366 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
367 Improved retrieval of facts from theory/proof context.
369 * February 2005: Lucas Dixon, University of Edinburgh
370 Improved subst method.
372 * 2005: Brian Huffman, OGI
373 Various improvements of HOLCF.
374 Some improvements of the HOL-Complex library.
376 * 2005: Claire Quigley and Jia Meng, University of Cambridge
377 Some support for asynchronous communication with external provers
380 * 2005: Florian Haftmann, TUM
381 Contributions to document 'sugar'.
382 Various ML combinators, notably linear functional transformations.
383 Some cleanup of ML legacy.
384 Additional antiquotations.
385 Improved Isabelle web site.
387 * 2004/2005: David Aspinall, University of Edinburgh
388 Various elements of XML and PGIP based communication with user
389 interfaces (experimental).
391 * 2004/2005: Gerwin Klein, NICTA
392 Contributions to document 'sugar'.
393 Improved Isabelle web site.
394 Improved HTML presentation of theories.
396 * 2004/2005: Clemens Ballarin, TUM
397 Provers: tools for transitive relations and quasi orders.
398 Improved version of locales, notably interpretation of locales.
399 Improved version of HOL-Algebra.
401 * 2004/2005: Amine Chaieb, TUM
402 Improved version of HOL presburger method.
404 * 2004/2005: Steven Obua, TUM
405 Improved version of HOL/Import, support for HOL-Light.
406 Improved version of HOL-Complex-Matrix.
407 Pure/defs: more sophisticated checks on well-formedness of overloading.
408 Pure/Tools: an experimental evaluator for lambda terms.
410 * 2004/2005: Norbert Schirmer, TUM
411 Contributions to document 'sugar'.
412 Improved version of HOL/record.
414 * 2004/2005: Sebastian Skalberg, TUM
415 Improved version of HOL/Import.
416 Some internal ML reorganizations.
418 * 2004/2005: Tjark Weber, TUM
419 SAT solver method using zChaff.
420 Improved version of HOL/refute.