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 * July 2010: Florian Haftmann, TUM
10 Reworking and extension of the Isabelle/HOL framework.
13 Contributions to Isabelle2009-2
14 --------------------------------------
16 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
17 Makarius Wenzel, TUM / LRI
18 Elimination of type classes from proof terms.
20 * April 2010: Florian Haftmann, TUM
21 Reorganization of abstract algebra type classes.
23 * April 2010: Florian Haftmann, TUM
24 Code generation for data representations involving invariants;
25 various collections avaiable in theories Fset, Dlist, RBT,
26 Mapping and AssocList.
28 * March 2010: Sascha Boehme, TUM
29 Efficient SHA1 library for Poly/ML.
31 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
32 Quotient type package for Isabelle/HOL.
35 Contributions to Isabelle2009-1
36 -------------------------------
38 * November 2009, Brian Huffman, PSU
39 New definitional domain package for HOLCF.
41 * November 2009: Robert Himmelmann, TUM
42 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
44 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
45 A tabled implementation of the reflexive transitive closure.
47 * November 2009: Lukas Bulwahn, TUM
48 Predicate Compiler: a compiler for inductive predicates to
49 equational specifications.
51 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
52 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
54 * October 2009: Jasmin Blanchette, TUM
55 Nitpick: yet another counterexample generator for Isabelle/HOL.
57 * October 2009: Sascha Boehme, TUM
58 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
60 * October 2009: Florian Haftmann, TUM
61 Refinement of parts of the HOL datatype package.
63 * October 2009: Florian Haftmann, TUM
64 Generic term styles for term antiquotations.
66 * September 2009: Thomas Sewell, NICTA
67 More efficient HOL/record implementation.
69 * September 2009: Sascha Boehme, TUM
70 SMT method using external SMT solvers.
72 * September 2009: Florian Haftmann, TUM
73 Refinement of sets and lattices.
75 * July 2009: Jeremy Avigad and Amine Chaieb
78 * July 2009: Philipp Meyer, TUM
79 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
82 * July 2009: Florian Haftmann, TUM
83 New quickcheck implementation using new code generator.
85 * July 2009: Florian Haftmann, TUM
86 HOL/Library/FSet: an explicit type of sets; finite sets ready to use
89 * June 2009: Florian Haftmann, TUM
90 HOL/Library/Tree: search trees implementing mappings, ready to use
93 * March 2009: Philipp Meyer, TUM
94 Minimization tool for results from Sledgehammer.
97 Contributions to Isabelle2009
98 -----------------------------
100 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
102 Elementary topology in Euclidean space.
104 * March 2009: Johannes Hoelzl, TUM
105 Method "approximation", which proves real valued inequalities by
108 * February 2009: Filip Maric, Univ. of Belgrade
111 * February 2009: Jasmin Christian Blanchette, TUM
112 Misc cleanup of HOL/refute.
114 * February 2009: Timothy Bourke, NICTA
115 New find_consts command.
117 * February 2009: Timothy Bourke, NICTA
118 "solves" criterion for find_theorems and auto_solve option
120 * December 2008: Clemens Ballarin, TUM
121 New locale implementation.
123 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
124 Method "sizechange" for advanced termination proofs.
126 * November 2008: Timothy Bourke, NICTA
127 Performance improvement (factor 50) for find_theorems.
129 * 2008: Florian Haftmann, TUM
130 Various extensions and restructurings in HOL, improvements
131 in evaluation mechanisms, new module binding.ML for name bindings.
133 * October 2008: Fabian Immler, TUM
134 ATP manager for Sledgehammer, based on ML threads instead of Posix
135 processes. Additional ATP wrappers, including remote SystemOnTPTP
138 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
139 Prover for coherent logic.
141 * August 2008: Fabian Immler, TUM
142 Vampire wrapper script for remote SystemOnTPTP service.
145 Contributions to Isabelle2008
146 -----------------------------
149 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
150 HOL library improvements.
152 * 2007/2008: Brian Huffman, PSU
153 HOLCF library improvements.
155 * 2007/2008: Stefan Berghofer, TUM
156 HOL-Nominal package improvements.
158 * March 2008: Markus Reiter, TUM
159 HOL/Library/RBT: red-black trees.
161 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
162 Lukas Bulwahn, TUM and John Matthews, Galois:
163 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
166 * December 2007: Norbert Schirmer, Uni Saarbruecken
167 Misc improvements of record package in HOL.
169 * December 2007: Florian Haftmann, TUM
170 Overloading and class instantiation target.
172 * December 2007: Florian Haftmann, TUM
173 New version of primrec package for local theories.
175 * December 2007: Alexander Krauss, TUM
176 Method "induction_scheme" in HOL.
178 * November 2007: Peter Lammich, Uni Muenster
179 HOL-Lattice: some more lemmas.
182 Contributions to Isabelle2007
183 -----------------------------
185 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
186 State Spaces: The Locale Way (in HOL).
188 * October 2007: Mark A. Hillebrand, DFKI
189 Robust sub/superscripts in LaTeX document output.
191 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
192 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
193 HOL-Word: a library for fixed-size machine words in Isabelle.
195 * August 2007: Brian Huffman, PSU
196 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
198 * June 2007: Amine Chaieb, TUM
199 Semiring normalization and Groebner Bases.
200 Support for dense linear orders.
202 * June 2007: Joe Hurd, Oxford
203 Metis theorem-prover.
205 * 2007: Kong W. Susanto, Cambridge
206 HOL: Metis prover integration.
208 * 2007: Stefan Berghofer, TUM
209 HOL: inductive predicates and sets.
211 * 2007: Norbert Schirmer, TUM
212 HOL/record: misc improvements.
214 * 2006/2007: Alexander Krauss, TUM
215 HOL: function package and related theories on termination.
217 * 2006/2007: Florian Haftmann, TUM
218 Pure: generic code generator framework.
220 HOL: theory reorganization, code generator setup.
222 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
224 HOL/Nominal package and related tools.
226 * November 2006: Lukas Bulwahn, TUM
227 HOL: method "lexicographic_order" for function package.
229 * October 2006: Stefan Hohe, TUM
230 HOL-Algebra: ideals and quotients over rings.
232 * August 2006: Amine Chaieb, TUM
233 Experimental support for generic reflection and reification in HOL.
235 * July 2006: Rafal Kolanski, NICTA
236 Hex (0xFF) and binary (0b1011) numerals.
238 * May 2006: Klaus Aehlig, LMU
239 Command 'normal_form': normalization by evaluation.
241 * May 2006: Amine Chaieb, TUM
242 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
245 * February 2006: Benjamin Porter, NICTA
246 HOL and HOL-Complex: generalised mean value theorem, continuum is
247 not denumerable, harmonic and arithmetic series, and denumerability
250 * October 2005: Martin Wildmoser, TUM
251 Sketch for Isar 'guess' element.
254 Contributions to Isabelle2005
255 -----------------------------
257 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
258 HOL-Complex: Formalization of Taylor series.
260 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
261 Components for SAT solver method using zChaff.
263 * September 2005: Ning Zhang and Christian Urban, LMU Munich
266 * September 2005: Bernhard Haeupler, TUM
267 Method comm_ring for proving equalities in commutative rings.
269 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
270 Various improvements of the HOL and HOL-Complex library.
272 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
273 Some structured proofs about completeness of real numbers.
275 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
276 Improved retrieval of facts from theory/proof context.
278 * February 2005: Lucas Dixon, University of Edinburgh
279 Improved subst method.
281 * 2005: Brian Huffman, OGI
282 Various improvements of HOLCF.
283 Some improvements of the HOL-Complex library.
285 * 2005: Claire Quigley and Jia Meng, University of Cambridge
286 Some support for asynchronous communication with external provers
289 * 2005: Florian Haftmann, TUM
290 Contributions to document 'sugar'.
291 Various ML combinators, notably linear functional transformations.
292 Some cleanup of ML legacy.
293 Additional antiquotations.
294 Improved Isabelle web site.
296 * 2004/2005: David Aspinall, University of Edinburgh
297 Various elements of XML and PGIP based communication with user
298 interfaces (experimental).
300 * 2004/2005: Gerwin Klein, NICTA
301 Contributions to document 'sugar'.
302 Improved Isabelle web site.
303 Improved HTML presentation of theories.
305 * 2004/2005: Clemens Ballarin, TUM
306 Provers: tools for transitive relations and quasi orders.
307 Improved version of locales, notably interpretation of locales.
308 Improved version of HOL-Algebra.
310 * 2004/2005: Amine Chaieb, TUM
311 Improved version of HOL presburger method.
313 * 2004/2005: Steven Obua, TUM
314 Improved version of HOL/Import, support for HOL-Light.
315 Improved version of HOL-Complex-Matrix.
316 Pure/defs: more sophisticated checks on well-formedness of overloading.
317 Pure/Tools: an experimental evaluator for lambda terms.
319 * 2004/2005: Norbert Schirmer, TUM
320 Contributions to document 'sugar'.
321 Improved version of HOL/record.
323 * 2004/2005: Sebastian Skalberg, TUM
324 Improved version of HOL/Import.
325 Some internal ML reorganizations.
327 * 2004/2005: Tjark Weber, TUM
328 SAT solver method using zChaff.
329 Improved version of HOL/refute.