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