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
7 Contributions to Isabelle2009-1
8 -------------------------------
10 * November 2009, Brian Huffman, PSU
11 New definitional domain package for HOLCF.
13 * November 2009: Robert Himmelmann, TUM
14 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
16 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
17 A tabled implementation of the reflexive transitive closure.
19 * November 2009: Lukas Bulwahn, TUM
20 Predicate Compiler: a compiler for inductive predicates to
21 equational specifications.
23 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
24 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
26 * October 2009: Jasmin Blanchette, TUM
27 Nitpick: yet another counterexample generator for Isabelle/HOL.
29 * October 2009: Sascha Boehme, TUM
30 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
32 * October 2009: Florian Haftmann, TUM
33 Refinement of parts of the HOL datatype package.
35 * October 2009: Florian Haftmann, TUM
36 Generic term styles for term antiquotations.
38 * September 2009: Thomas Sewell, NICTA
39 More efficient HOL/record implementation.
41 * September 2009: Sascha Boehme, TUM
42 SMT method using external SMT solvers.
44 * September 2009: Florian Haftmann, TUM
45 Refinement of sets and lattices.
47 * July 2009: Jeremy Avigad and Amine Chaieb
50 * July 2009: Philipp Meyer, TUM
51 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
54 * July 2009: Florian Haftmann, TUM
55 New quickcheck implementation using new code generator.
57 * July 2009: Florian Haftmann, TUM
58 HOL/Library/FSet: an explicit type of sets; finite sets ready to use
61 * June 2009: Florian Haftmann, TUM
62 HOL/Library/Tree: search trees implementing mappings, ready to use
65 * March 2009: Philipp Meyer, TUM
66 Minimization tool for results from Sledgehammer.
69 Contributions to Isabelle2009
70 -----------------------------
72 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
74 Elementary topology in Euclidean space.
76 * March 2009: Johannes Hoelzl, TUM
77 Method "approximation", which proves real valued inequalities by
80 * February 2009: Filip Maric, Univ. of Belgrade
83 * February 2009: Jasmin Christian Blanchette, TUM
84 Misc cleanup of HOL/refute.
86 * February 2009: Timothy Bourke, NICTA
87 New find_consts command.
89 * February 2009: Timothy Bourke, NICTA
90 "solves" criterion for find_theorems and auto_solve option
92 * December 2008: Clemens Ballarin, TUM
93 New locale implementation.
95 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
96 Method "sizechange" for advanced termination proofs.
98 * November 2008: Timothy Bourke, NICTA
99 Performance improvement (factor 50) for find_theorems.
101 * 2008: Florian Haftmann, TUM
102 Various extensions and restructurings in HOL, improvements
103 in evaluation mechanisms, new module binding.ML for name bindings.
105 * October 2008: Fabian Immler, TUM
106 ATP manager for Sledgehammer, based on ML threads instead of Posix
107 processes. Additional ATP wrappers, including remote SystemOnTPTP
110 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
111 Prover for coherent logic.
113 * August 2008: Fabian Immler, TUM
114 Vampire wrapper script for remote SystemOnTPTP service.
117 Contributions to Isabelle2008
118 -----------------------------
121 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
122 HOL library improvements.
124 * 2007/2008: Brian Huffman, PSU
125 HOLCF library improvements.
127 * 2007/2008: Stefan Berghofer, TUM
128 HOL-Nominal package improvements.
130 * March 2008: Markus Reiter, TUM
131 HOL/Library/RBT: red-black trees.
133 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
134 Lukas Bulwahn, TUM and John Matthews, Galois:
135 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
138 * December 2007: Norbert Schirmer, Uni Saarbruecken
139 Misc improvements of record package in HOL.
141 * December 2007: Florian Haftmann, TUM
142 Overloading and class instantiation target.
144 * December 2007: Florian Haftmann, TUM
145 New version of primrec package for local theories.
147 * December 2007: Alexander Krauss, TUM
148 Method "induction_scheme" in HOL.
150 * November 2007: Peter Lammich, Uni Muenster
151 HOL-Lattice: some more lemmas.
154 Contributions to Isabelle2007
155 -----------------------------
157 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
158 State Spaces: The Locale Way (in HOL).
160 * October 2007: Mark A. Hillebrand, DFKI
161 Robust sub/superscripts in LaTeX document output.
163 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
164 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
165 HOL-Word: a library for fixed-size machine words in Isabelle.
167 * August 2007: Brian Huffman, PSU
168 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
170 * June 2007: Amine Chaieb, TUM
171 Semiring normalization and Groebner Bases.
172 Support for dense linear orders.
174 * June 2007: Joe Hurd, Oxford
175 Metis theorem-prover.
177 * 2007: Kong W. Susanto, Cambridge
178 HOL: Metis prover integration.
180 * 2007: Stefan Berghofer, TUM
181 HOL: inductive predicates and sets.
183 * 2007: Norbert Schirmer, TUM
184 HOL/record: misc improvements.
186 * 2006/2007: Alexander Krauss, TUM
187 HOL: function package and related theories on termination.
189 * 2006/2007: Florian Haftmann, TUM
190 Pure: generic code generator framework.
192 HOL: theory reorganization, code generator setup.
194 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
196 HOL/Nominal package and related tools.
198 * November 2006: Lukas Bulwahn, TUM
199 HOL: method "lexicographic_order" for function package.
201 * October 2006: Stefan Hohe, TUM
202 HOL-Algebra: ideals and quotients over rings.
204 * August 2006: Amine Chaieb, TUM
205 Experimental support for generic reflection and reification in HOL.
207 * July 2006: Rafal Kolanski, NICTA
208 Hex (0xFF) and binary (0b1011) numerals.
210 * May 2006: Klaus Aehlig, LMU
211 Command 'normal_form': normalization by evaluation.
213 * May 2006: Amine Chaieb, TUM
214 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
217 * February 2006: Benjamin Porter, NICTA
218 HOL and HOL-Complex: generalised mean value theorem, continuum is
219 not denumerable, harmonic and arithmetic series, and denumerability
222 * October 2005: Martin Wildmoser, TUM
223 Sketch for Isar 'guess' element.
226 Contributions to Isabelle2005
227 -----------------------------
229 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
230 HOL-Complex: Formalization of Taylor series.
232 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
233 Components for SAT solver method using zChaff.
235 * September 2005: Ning Zhang and Christian Urban, LMU Munich
238 * September 2005: Bernhard Haeupler, TUM
239 Method comm_ring for proving equalities in commutative rings.
241 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
242 Various improvements of the HOL and HOL-Complex library.
244 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
245 Some structured proofs about completeness of real numbers.
247 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
248 Improved retrieval of facts from theory/proof context.
250 * February 2005: Lucas Dixon, University of Edinburgh
251 Improved subst method.
253 * 2005: Brian Huffman, OGI
254 Various improvements of HOLCF.
255 Some improvements of the HOL-Complex library.
257 * 2005: Claire Quigley and Jia Meng, University of Cambridge
258 Some support for asynchronous communication with external provers
261 * 2005: Florian Haftmann, TUM
262 Contributions to document 'sugar'.
263 Various ML combinators, notably linear functional transformations.
264 Some cleanup of ML legacy.
265 Additional antiquotations.
266 Improved Isabelle web site.
268 * 2004/2005: David Aspinall, University of Edinburgh
269 Various elements of XML and PGIP based communication with user
270 interfaces (experimental).
272 * 2004/2005: Gerwin Klein, NICTA
273 Contributions to document 'sugar'.
274 Improved Isabelle web site.
275 Improved HTML presentation of theories.
277 * 2004/2005: Clemens Ballarin, TUM
278 Provers: tools for transitive relations and quasi orders.
279 Improved version of locales, notably interpretation of locales.
280 Improved version of HOL-Algebra.
282 * 2004/2005: Amine Chaieb, TUM
283 Improved version of HOL presburger method.
285 * 2004/2005: Steven Obua, TUM
286 Improved version of HOL/Import, support for HOL-Light.
287 Improved version of HOL-Complex-Matrix.
288 Pure/defs: more sophisticated checks on well-formedness of overloading.
289 Pure/Tools: an experimental evaluator for lambda terms.
291 * 2004/2005: Norbert Schirmer, TUM
292 Contributions to document 'sugar'.
293 Improved version of HOL/record.
295 * 2004/2005: Sebastian Skalberg, TUM
296 Improved version of HOL/Import.
297 Some internal ML reorganizations.
299 * 2004/2005: Tjark Weber, TUM
300 SAT solver method using zChaff.
301 Improved version of HOL/refute.