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 Isabelle2011
11 -----------------------------
13 * January 2011: Stefan Berghofer, secunet Security Networks AG
14 HOL-SPARK: an interactive prover back-end for SPARK.
16 * October 2010: Bogdan Grechuk, University of Edinburgh
17 Extended convex analysis in Multivariate Analysis.
19 * October 2010: Dmitriy Traytel, TUM
20 Coercive subtyping via subtype constraints.
22 * October 2010: Alexander Krauss, TUM
23 Command partial_function for function definitions based on complete
24 partial orders in HOL.
26 * September 2010: Florian Haftmann, TUM
27 Refined concepts for evaluation, i.e., normalization of terms using
30 * September 2010: Florian Haftmann, TUM
31 Code generation for Scala.
33 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
34 Improved Probability theory in HOL.
36 * July 2010: Florian Haftmann, TUM
37 Reworking and extension of the Imperative HOL framework.
39 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
41 Ad-hoc overloading. Generic do notation for monads.
44 Contributions to Isabelle2009-2
45 -------------------------------
47 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
48 Makarius Wenzel, TUM / LRI
49 Elimination of type classes from proof terms.
51 * April 2010: Florian Haftmann, TUM
52 Reorganization of abstract algebra type classes.
54 * April 2010: Florian Haftmann, TUM
55 Code generation for data representations involving invariants;
56 various collections avaiable in theories Fset, Dlist, RBT,
57 Mapping and AssocList.
59 * March 2010: Sascha Boehme, TUM
60 Efficient SHA1 library for Poly/ML.
62 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
63 Quotient type package for Isabelle/HOL.
66 Contributions to Isabelle2009-1
67 -------------------------------
69 * November 2009, Brian Huffman, PSU
70 New definitional domain package for HOLCF.
72 * November 2009: Robert Himmelmann, TUM
73 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
75 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
76 A tabled implementation of the reflexive transitive closure.
78 * November 2009: Lukas Bulwahn, TUM
79 Predicate Compiler: a compiler for inductive predicates to
80 equational specifications.
82 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
83 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
85 * October 2009: Jasmin Blanchette, TUM
86 Nitpick: yet another counterexample generator for Isabelle/HOL.
88 * October 2009: Sascha Boehme, TUM
89 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
91 * October 2009: Florian Haftmann, TUM
92 Refinement of parts of the HOL datatype package.
94 * October 2009: Florian Haftmann, TUM
95 Generic term styles for term antiquotations.
97 * September 2009: Thomas Sewell, NICTA
98 More efficient HOL/record implementation.
100 * September 2009: Sascha Boehme, TUM
101 SMT method using external SMT solvers.
103 * September 2009: Florian Haftmann, TUM
104 Refinement of sets and lattices.
106 * July 2009: Jeremy Avigad and Amine Chaieb
109 * July 2009: Philipp Meyer, TUM
110 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
113 * July 2009: Florian Haftmann, TUM
114 New quickcheck implementation using new code generator.
116 * July 2009: Florian Haftmann, TUM
117 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
120 * June 2009: Florian Haftmann, TUM
121 HOL/Library/Tree: search trees implementing mappings, ready to use
124 * March 2009: Philipp Meyer, TUM
125 Minimization tool for results from Sledgehammer.
128 Contributions to Isabelle2009
129 -----------------------------
131 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
133 Elementary topology in Euclidean space.
135 * March 2009: Johannes Hoelzl, TUM
136 Method "approximation", which proves real valued inequalities by
139 * February 2009: Filip Maric, Univ. of Belgrade
142 * February 2009: Jasmin Christian Blanchette, TUM
143 Misc cleanup of HOL/refute.
145 * February 2009: Timothy Bourke, NICTA
146 New find_consts command.
148 * February 2009: Timothy Bourke, NICTA
149 "solves" criterion for find_theorems and auto_solve option
151 * December 2008: Clemens Ballarin, TUM
152 New locale implementation.
154 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
155 Method "sizechange" for advanced termination proofs.
157 * November 2008: Timothy Bourke, NICTA
158 Performance improvement (factor 50) for find_theorems.
160 * 2008: Florian Haftmann, TUM
161 Various extensions and restructurings in HOL, improvements
162 in evaluation mechanisms, new module binding.ML for name bindings.
164 * October 2008: Fabian Immler, TUM
165 ATP manager for Sledgehammer, based on ML threads instead of Posix
166 processes. Additional ATP wrappers, including remote SystemOnTPTP
169 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
170 Prover for coherent logic.
172 * August 2008: Fabian Immler, TUM
173 Vampire wrapper script for remote SystemOnTPTP service.
176 Contributions to Isabelle2008
177 -----------------------------
180 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
181 HOL library improvements.
183 * 2007/2008: Brian Huffman, PSU
184 HOLCF library improvements.
186 * 2007/2008: Stefan Berghofer, TUM
187 HOL-Nominal package improvements.
189 * March 2008: Markus Reiter, TUM
190 HOL/Library/RBT: red-black trees.
192 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
193 Lukas Bulwahn, TUM and John Matthews, Galois:
194 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
197 * December 2007: Norbert Schirmer, Uni Saarbruecken
198 Misc improvements of record package in HOL.
200 * December 2007: Florian Haftmann, TUM
201 Overloading and class instantiation target.
203 * December 2007: Florian Haftmann, TUM
204 New version of primrec package for local theories.
206 * December 2007: Alexander Krauss, TUM
207 Method "induction_scheme" in HOL.
209 * November 2007: Peter Lammich, Uni Muenster
210 HOL-Lattice: some more lemmas.
213 Contributions to Isabelle2007
214 -----------------------------
216 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
217 State Spaces: The Locale Way (in HOL).
219 * October 2007: Mark A. Hillebrand, DFKI
220 Robust sub/superscripts in LaTeX document output.
222 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
223 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
224 HOL-Word: a library for fixed-size machine words in Isabelle.
226 * August 2007: Brian Huffman, PSU
227 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
229 * June 2007: Amine Chaieb, TUM
230 Semiring normalization and Groebner Bases.
231 Support for dense linear orders.
233 * June 2007: Joe Hurd, Oxford
234 Metis theorem-prover.
236 * 2007: Kong W. Susanto, Cambridge
237 HOL: Metis prover integration.
239 * 2007: Stefan Berghofer, TUM
240 HOL: inductive predicates and sets.
242 * 2007: Norbert Schirmer, TUM
243 HOL/record: misc improvements.
245 * 2006/2007: Alexander Krauss, TUM
246 HOL: function package and related theories on termination.
248 * 2006/2007: Florian Haftmann, TUM
249 Pure: generic code generator framework.
251 HOL: theory reorganization, code generator setup.
253 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
255 HOL/Nominal package and related tools.
257 * November 2006: Lukas Bulwahn, TUM
258 HOL: method "lexicographic_order" for function package.
260 * October 2006: Stefan Hohe, TUM
261 HOL-Algebra: ideals and quotients over rings.
263 * August 2006: Amine Chaieb, TUM
264 Experimental support for generic reflection and reification in HOL.
266 * July 2006: Rafal Kolanski, NICTA
267 Hex (0xFF) and binary (0b1011) numerals.
269 * May 2006: Klaus Aehlig, LMU
270 Command 'normal_form': normalization by evaluation.
272 * May 2006: Amine Chaieb, TUM
273 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
276 * February 2006: Benjamin Porter, NICTA
277 HOL and HOL-Complex: generalised mean value theorem, continuum is
278 not denumerable, harmonic and arithmetic series, and denumerability
281 * October 2005: Martin Wildmoser, TUM
282 Sketch for Isar 'guess' element.
285 Contributions to Isabelle2005
286 -----------------------------
288 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
289 HOL-Complex: Formalization of Taylor series.
291 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
292 Components for SAT solver method using zChaff.
294 * September 2005: Ning Zhang and Christian Urban, LMU Munich
297 * September 2005: Bernhard Haeupler, TUM
298 Method comm_ring for proving equalities in commutative rings.
300 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
301 Various improvements of the HOL and HOL-Complex library.
303 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
304 Some structured proofs about completeness of real numbers.
306 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
307 Improved retrieval of facts from theory/proof context.
309 * February 2005: Lucas Dixon, University of Edinburgh
310 Improved subst method.
312 * 2005: Brian Huffman, OGI
313 Various improvements of HOLCF.
314 Some improvements of the HOL-Complex library.
316 * 2005: Claire Quigley and Jia Meng, University of Cambridge
317 Some support for asynchronous communication with external provers
320 * 2005: Florian Haftmann, TUM
321 Contributions to document 'sugar'.
322 Various ML combinators, notably linear functional transformations.
323 Some cleanup of ML legacy.
324 Additional antiquotations.
325 Improved Isabelle web site.
327 * 2004/2005: David Aspinall, University of Edinburgh
328 Various elements of XML and PGIP based communication with user
329 interfaces (experimental).
331 * 2004/2005: Gerwin Klein, NICTA
332 Contributions to document 'sugar'.
333 Improved Isabelle web site.
334 Improved HTML presentation of theories.
336 * 2004/2005: Clemens Ballarin, TUM
337 Provers: tools for transitive relations and quasi orders.
338 Improved version of locales, notably interpretation of locales.
339 Improved version of HOL-Algebra.
341 * 2004/2005: Amine Chaieb, TUM
342 Improved version of HOL presburger method.
344 * 2004/2005: Steven Obua, TUM
345 Improved version of HOL/Import, support for HOL-Light.
346 Improved version of HOL-Complex-Matrix.
347 Pure/defs: more sophisticated checks on well-formedness of overloading.
348 Pure/Tools: an experimental evaluator for lambda terms.
350 * 2004/2005: Norbert Schirmer, TUM
351 Contributions to document 'sugar'.
352 Improved version of HOL/record.
354 * 2004/2005: Sebastian Skalberg, TUM
355 Improved version of HOL/Import.
356 Some internal ML reorganizations.
358 * 2004/2005: Tjark Weber, TUM
359 SAT solver method using zChaff.
360 Improved version of HOL/refute.