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 Isabelle2011
7 -----------------------------
9 * October 2010: Bogdan Grechuk, University of Edinburgh
10 Extended convex analysis in Multivariate Analysis.
12 * October 2010: Dmitriy Traytel, TUM
13 Coercive subtyping via subtype constraints.
15 * September 2010: Florian Haftmann, TUM
16 Refined concepts for evaluation, i.e. normalisation of terms using different techniques.
18 * September 2010: Florian Haftmann, TUM
19 Code generation for Scala.
21 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
22 Rewriting the Probability theory.
24 * July 2010: Florian Haftmann, TUM
25 Reworking and extension of the Imperative HOL framework.
28 Contributions to Isabelle2009-2
29 -------------------------------
31 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
32 Makarius Wenzel, TUM / LRI
33 Elimination of type classes from proof terms.
35 * April 2010: Florian Haftmann, TUM
36 Reorganization of abstract algebra type classes.
38 * April 2010: Florian Haftmann, TUM
39 Code generation for data representations involving invariants;
40 various collections avaiable in theories Fset, Dlist, RBT,
41 Mapping and AssocList.
43 * March 2010: Sascha Boehme, TUM
44 Efficient SHA1 library for Poly/ML.
46 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
47 Quotient type package for Isabelle/HOL.
50 Contributions to Isabelle2009-1
51 -------------------------------
53 * November 2009, Brian Huffman, PSU
54 New definitional domain package for HOLCF.
56 * November 2009: Robert Himmelmann, TUM
57 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
59 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
60 A tabled implementation of the reflexive transitive closure.
62 * November 2009: Lukas Bulwahn, TUM
63 Predicate Compiler: a compiler for inductive predicates to
64 equational specifications.
66 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
67 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
69 * October 2009: Jasmin Blanchette, TUM
70 Nitpick: yet another counterexample generator for Isabelle/HOL.
72 * October 2009: Sascha Boehme, TUM
73 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
75 * October 2009: Florian Haftmann, TUM
76 Refinement of parts of the HOL datatype package.
78 * October 2009: Florian Haftmann, TUM
79 Generic term styles for term antiquotations.
81 * September 2009: Thomas Sewell, NICTA
82 More efficient HOL/record implementation.
84 * September 2009: Sascha Boehme, TUM
85 SMT method using external SMT solvers.
87 * September 2009: Florian Haftmann, TUM
88 Refinement of sets and lattices.
90 * July 2009: Jeremy Avigad and Amine Chaieb
93 * July 2009: Philipp Meyer, TUM
94 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
97 * July 2009: Florian Haftmann, TUM
98 New quickcheck implementation using new code generator.
100 * July 2009: Florian Haftmann, TUM
101 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
104 * June 2009: Florian Haftmann, TUM
105 HOL/Library/Tree: search trees implementing mappings, ready to use
108 * March 2009: Philipp Meyer, TUM
109 Minimization tool for results from Sledgehammer.
112 Contributions to Isabelle2009
113 -----------------------------
115 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
117 Elementary topology in Euclidean space.
119 * March 2009: Johannes Hoelzl, TUM
120 Method "approximation", which proves real valued inequalities by
123 * February 2009: Filip Maric, Univ. of Belgrade
126 * February 2009: Jasmin Christian Blanchette, TUM
127 Misc cleanup of HOL/refute.
129 * February 2009: Timothy Bourke, NICTA
130 New find_consts command.
132 * February 2009: Timothy Bourke, NICTA
133 "solves" criterion for find_theorems and auto_solve option
135 * December 2008: Clemens Ballarin, TUM
136 New locale implementation.
138 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
139 Method "sizechange" for advanced termination proofs.
141 * November 2008: Timothy Bourke, NICTA
142 Performance improvement (factor 50) for find_theorems.
144 * 2008: Florian Haftmann, TUM
145 Various extensions and restructurings in HOL, improvements
146 in evaluation mechanisms, new module binding.ML for name bindings.
148 * October 2008: Fabian Immler, TUM
149 ATP manager for Sledgehammer, based on ML threads instead of Posix
150 processes. Additional ATP wrappers, including remote SystemOnTPTP
153 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
154 Prover for coherent logic.
156 * August 2008: Fabian Immler, TUM
157 Vampire wrapper script for remote SystemOnTPTP service.
160 Contributions to Isabelle2008
161 -----------------------------
164 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
165 HOL library improvements.
167 * 2007/2008: Brian Huffman, PSU
168 HOLCF library improvements.
170 * 2007/2008: Stefan Berghofer, TUM
171 HOL-Nominal package improvements.
173 * March 2008: Markus Reiter, TUM
174 HOL/Library/RBT: red-black trees.
176 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
177 Lukas Bulwahn, TUM and John Matthews, Galois:
178 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
181 * December 2007: Norbert Schirmer, Uni Saarbruecken
182 Misc improvements of record package in HOL.
184 * December 2007: Florian Haftmann, TUM
185 Overloading and class instantiation target.
187 * December 2007: Florian Haftmann, TUM
188 New version of primrec package for local theories.
190 * December 2007: Alexander Krauss, TUM
191 Method "induction_scheme" in HOL.
193 * November 2007: Peter Lammich, Uni Muenster
194 HOL-Lattice: some more lemmas.
197 Contributions to Isabelle2007
198 -----------------------------
200 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
201 State Spaces: The Locale Way (in HOL).
203 * October 2007: Mark A. Hillebrand, DFKI
204 Robust sub/superscripts in LaTeX document output.
206 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
207 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
208 HOL-Word: a library for fixed-size machine words in Isabelle.
210 * August 2007: Brian Huffman, PSU
211 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
213 * June 2007: Amine Chaieb, TUM
214 Semiring normalization and Groebner Bases.
215 Support for dense linear orders.
217 * June 2007: Joe Hurd, Oxford
218 Metis theorem-prover.
220 * 2007: Kong W. Susanto, Cambridge
221 HOL: Metis prover integration.
223 * 2007: Stefan Berghofer, TUM
224 HOL: inductive predicates and sets.
226 * 2007: Norbert Schirmer, TUM
227 HOL/record: misc improvements.
229 * 2006/2007: Alexander Krauss, TUM
230 HOL: function package and related theories on termination.
232 * 2006/2007: Florian Haftmann, TUM
233 Pure: generic code generator framework.
235 HOL: theory reorganization, code generator setup.
237 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
239 HOL/Nominal package and related tools.
241 * November 2006: Lukas Bulwahn, TUM
242 HOL: method "lexicographic_order" for function package.
244 * October 2006: Stefan Hohe, TUM
245 HOL-Algebra: ideals and quotients over rings.
247 * August 2006: Amine Chaieb, TUM
248 Experimental support for generic reflection and reification in HOL.
250 * July 2006: Rafal Kolanski, NICTA
251 Hex (0xFF) and binary (0b1011) numerals.
253 * May 2006: Klaus Aehlig, LMU
254 Command 'normal_form': normalization by evaluation.
256 * May 2006: Amine Chaieb, TUM
257 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
260 * February 2006: Benjamin Porter, NICTA
261 HOL and HOL-Complex: generalised mean value theorem, continuum is
262 not denumerable, harmonic and arithmetic series, and denumerability
265 * October 2005: Martin Wildmoser, TUM
266 Sketch for Isar 'guess' element.
269 Contributions to Isabelle2005
270 -----------------------------
272 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
273 HOL-Complex: Formalization of Taylor series.
275 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
276 Components for SAT solver method using zChaff.
278 * September 2005: Ning Zhang and Christian Urban, LMU Munich
281 * September 2005: Bernhard Haeupler, TUM
282 Method comm_ring for proving equalities in commutative rings.
284 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
285 Various improvements of the HOL and HOL-Complex library.
287 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
288 Some structured proofs about completeness of real numbers.
290 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
291 Improved retrieval of facts from theory/proof context.
293 * February 2005: Lucas Dixon, University of Edinburgh
294 Improved subst method.
296 * 2005: Brian Huffman, OGI
297 Various improvements of HOLCF.
298 Some improvements of the HOL-Complex library.
300 * 2005: Claire Quigley and Jia Meng, University of Cambridge
301 Some support for asynchronous communication with external provers
304 * 2005: Florian Haftmann, TUM
305 Contributions to document 'sugar'.
306 Various ML combinators, notably linear functional transformations.
307 Some cleanup of ML legacy.
308 Additional antiquotations.
309 Improved Isabelle web site.
311 * 2004/2005: David Aspinall, University of Edinburgh
312 Various elements of XML and PGIP based communication with user
313 interfaces (experimental).
315 * 2004/2005: Gerwin Klein, NICTA
316 Contributions to document 'sugar'.
317 Improved Isabelle web site.
318 Improved HTML presentation of theories.
320 * 2004/2005: Clemens Ballarin, TUM
321 Provers: tools for transitive relations and quasi orders.
322 Improved version of locales, notably interpretation of locales.
323 Improved version of HOL-Algebra.
325 * 2004/2005: Amine Chaieb, TUM
326 Improved version of HOL presburger method.
328 * 2004/2005: Steven Obua, TUM
329 Improved version of HOL/Import, support for HOL-Light.
330 Improved version of HOL-Complex-Matrix.
331 Pure/defs: more sophisticated checks on well-formedness of overloading.
332 Pure/Tools: an experimental evaluator for lambda terms.
334 * 2004/2005: Norbert Schirmer, TUM
335 Contributions to document 'sugar'.
336 Improved version of HOL/record.
338 * 2004/2005: Sebastian Skalberg, TUM
339 Improved version of HOL/Import.
340 Some internal ML reorganizations.
342 * 2004/2005: Tjark Weber, TUM
343 SAT solver method using zChaff.
344 Improved version of HOL/refute.