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-1
11 -------------------------------
13 * September 2011: Peter Gammie
14 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
16 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
17 Refined theory on complete lattices.
19 * August 2011: Brian Huffman, Portland State University
20 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
22 * June 2011: Brian Huffman, Portland State University
23 Proof method "countable_datatype" for theory Library/Countable.
25 * 2011: Jasmin Blanchette, TUM
26 Various improvements to Sledgehammer, notably: use of sound
27 translations, support for more provers (Waldmeister, LEO-II,
28 Satallax). Further development of Nitpick and 'try' command.
30 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
31 Theory HOL/Library/Cset_Monad allows do notation for computable sets
32 (cset) via the generic monad ad-hoc overloading facility.
34 * 2011: Johannes Hölzl, Armin Heller, TUM and
35 Bogdan Grechuk, University of Edinburgh
36 Theory HOL/Library/Extended_Reals: real numbers extended with plus
39 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
40 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
44 Contributions to Isabelle2011
45 -----------------------------
47 * January 2011: Stefan Berghofer, secunet Security Networks AG
48 HOL-SPARK: an interactive prover back-end for SPARK.
50 * October 2010: Bogdan Grechuk, University of Edinburgh
51 Extended convex analysis in Multivariate Analysis.
53 * October 2010: Dmitriy Traytel, TUM
54 Coercive subtyping via subtype constraints.
56 * October 2010: Alexander Krauss, TUM
57 Command partial_function for function definitions based on complete
58 partial orders in HOL.
60 * September 2010: Florian Haftmann, TUM
61 Refined concepts for evaluation, i.e., normalization of terms using
64 * September 2010: Florian Haftmann, TUM
65 Code generation for Scala.
67 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
68 Improved Probability theory in HOL.
70 * July 2010: Florian Haftmann, TUM
71 Reworking and extension of the Imperative HOL framework.
73 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
75 Ad-hoc overloading. Generic do notation for monads.
78 Contributions to Isabelle2009-2
79 -------------------------------
81 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
82 Makarius Wenzel, TUM / LRI
83 Elimination of type classes from proof terms.
85 * April 2010: Florian Haftmann, TUM
86 Reorganization of abstract algebra type classes.
88 * April 2010: Florian Haftmann, TUM
89 Code generation for data representations involving invariants;
90 various collections avaiable in theories Fset, Dlist, RBT,
91 Mapping and AssocList.
93 * March 2010: Sascha Boehme, TUM
94 Efficient SHA1 library for Poly/ML.
96 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
97 Quotient type package for Isabelle/HOL.
100 Contributions to Isabelle2009-1
101 -------------------------------
103 * November 2009, Brian Huffman, PSU
104 New definitional domain package for HOLCF.
106 * November 2009: Robert Himmelmann, TUM
107 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
109 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
110 A tabled implementation of the reflexive transitive closure.
112 * November 2009: Lukas Bulwahn, TUM
113 Predicate Compiler: a compiler for inductive predicates to
114 equational specifications.
116 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
117 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
119 * October 2009: Jasmin Blanchette, TUM
120 Nitpick: yet another counterexample generator for Isabelle/HOL.
122 * October 2009: Sascha Boehme, TUM
123 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
125 * October 2009: Florian Haftmann, TUM
126 Refinement of parts of the HOL datatype package.
128 * October 2009: Florian Haftmann, TUM
129 Generic term styles for term antiquotations.
131 * September 2009: Thomas Sewell, NICTA
132 More efficient HOL/record implementation.
134 * September 2009: Sascha Boehme, TUM
135 SMT method using external SMT solvers.
137 * September 2009: Florian Haftmann, TUM
138 Refinement of sets and lattices.
140 * July 2009: Jeremy Avigad and Amine Chaieb
143 * July 2009: Philipp Meyer, TUM
144 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
147 * July 2009: Florian Haftmann, TUM
148 New quickcheck implementation using new code generator.
150 * July 2009: Florian Haftmann, TUM
151 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
154 * June 2009: Florian Haftmann, TUM
155 HOL/Library/Tree: search trees implementing mappings, ready to use
158 * March 2009: Philipp Meyer, TUM
159 Minimization tool for results from Sledgehammer.
162 Contributions to Isabelle2009
163 -----------------------------
165 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
167 Elementary topology in Euclidean space.
169 * March 2009: Johannes Hoelzl, TUM
170 Method "approximation", which proves real valued inequalities by
173 * February 2009: Filip Maric, Univ. of Belgrade
176 * February 2009: Jasmin Christian Blanchette, TUM
177 Misc cleanup of HOL/refute.
179 * February 2009: Timothy Bourke, NICTA
180 New find_consts command.
182 * February 2009: Timothy Bourke, NICTA
183 "solves" criterion for find_theorems and auto_solve option
185 * December 2008: Clemens Ballarin, TUM
186 New locale implementation.
188 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
189 Method "sizechange" for advanced termination proofs.
191 * November 2008: Timothy Bourke, NICTA
192 Performance improvement (factor 50) for find_theorems.
194 * 2008: Florian Haftmann, TUM
195 Various extensions and restructurings in HOL, improvements
196 in evaluation mechanisms, new module binding.ML for name bindings.
198 * October 2008: Fabian Immler, TUM
199 ATP manager for Sledgehammer, based on ML threads instead of Posix
200 processes. Additional ATP wrappers, including remote SystemOnTPTP
203 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
204 Prover for coherent logic.
206 * August 2008: Fabian Immler, TUM
207 Vampire wrapper script for remote SystemOnTPTP service.
210 Contributions to Isabelle2008
211 -----------------------------
214 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
215 HOL library improvements.
217 * 2007/2008: Brian Huffman, PSU
218 HOLCF library improvements.
220 * 2007/2008: Stefan Berghofer, TUM
221 HOL-Nominal package improvements.
223 * March 2008: Markus Reiter, TUM
224 HOL/Library/RBT: red-black trees.
226 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
227 Lukas Bulwahn, TUM and John Matthews, Galois:
228 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
231 * December 2007: Norbert Schirmer, Uni Saarbruecken
232 Misc improvements of record package in HOL.
234 * December 2007: Florian Haftmann, TUM
235 Overloading and class instantiation target.
237 * December 2007: Florian Haftmann, TUM
238 New version of primrec package for local theories.
240 * December 2007: Alexander Krauss, TUM
241 Method "induction_scheme" in HOL.
243 * November 2007: Peter Lammich, Uni Muenster
244 HOL-Lattice: some more lemmas.
247 Contributions to Isabelle2007
248 -----------------------------
250 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
251 State Spaces: The Locale Way (in HOL).
253 * October 2007: Mark A. Hillebrand, DFKI
254 Robust sub/superscripts in LaTeX document output.
256 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
257 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
258 HOL-Word: a library for fixed-size machine words in Isabelle.
260 * August 2007: Brian Huffman, PSU
261 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
263 * June 2007: Amine Chaieb, TUM
264 Semiring normalization and Groebner Bases.
265 Support for dense linear orders.
267 * June 2007: Joe Hurd, Oxford
268 Metis theorem-prover.
270 * 2007: Kong W. Susanto, Cambridge
271 HOL: Metis prover integration.
273 * 2007: Stefan Berghofer, TUM
274 HOL: inductive predicates and sets.
276 * 2007: Norbert Schirmer, TUM
277 HOL/record: misc improvements.
279 * 2006/2007: Alexander Krauss, TUM
280 HOL: function package and related theories on termination.
282 * 2006/2007: Florian Haftmann, TUM
283 Pure: generic code generator framework.
285 HOL: theory reorganization, code generator setup.
287 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
289 HOL/Nominal package and related tools.
291 * November 2006: Lukas Bulwahn, TUM
292 HOL: method "lexicographic_order" for function package.
294 * October 2006: Stefan Hohe, TUM
295 HOL-Algebra: ideals and quotients over rings.
297 * August 2006: Amine Chaieb, TUM
298 Experimental support for generic reflection and reification in HOL.
300 * July 2006: Rafal Kolanski, NICTA
301 Hex (0xFF) and binary (0b1011) numerals.
303 * May 2006: Klaus Aehlig, LMU
304 Command 'normal_form': normalization by evaluation.
306 * May 2006: Amine Chaieb, TUM
307 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
310 * February 2006: Benjamin Porter, NICTA
311 HOL and HOL-Complex: generalised mean value theorem, continuum is
312 not denumerable, harmonic and arithmetic series, and denumerability
315 * October 2005: Martin Wildmoser, TUM
316 Sketch for Isar 'guess' element.
319 Contributions to Isabelle2005
320 -----------------------------
322 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
323 HOL-Complex: Formalization of Taylor series.
325 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
326 Components for SAT solver method using zChaff.
328 * September 2005: Ning Zhang and Christian Urban, LMU Munich
331 * September 2005: Bernhard Haeupler, TUM
332 Method comm_ring for proving equalities in commutative rings.
334 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
335 Various improvements of the HOL and HOL-Complex library.
337 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
338 Some structured proofs about completeness of real numbers.
340 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
341 Improved retrieval of facts from theory/proof context.
343 * February 2005: Lucas Dixon, University of Edinburgh
344 Improved subst method.
346 * 2005: Brian Huffman, OGI
347 Various improvements of HOLCF.
348 Some improvements of the HOL-Complex library.
350 * 2005: Claire Quigley and Jia Meng, University of Cambridge
351 Some support for asynchronous communication with external provers
354 * 2005: Florian Haftmann, TUM
355 Contributions to document 'sugar'.
356 Various ML combinators, notably linear functional transformations.
357 Some cleanup of ML legacy.
358 Additional antiquotations.
359 Improved Isabelle web site.
361 * 2004/2005: David Aspinall, University of Edinburgh
362 Various elements of XML and PGIP based communication with user
363 interfaces (experimental).
365 * 2004/2005: Gerwin Klein, NICTA
366 Contributions to document 'sugar'.
367 Improved Isabelle web site.
368 Improved HTML presentation of theories.
370 * 2004/2005: Clemens Ballarin, TUM
371 Provers: tools for transitive relations and quasi orders.
372 Improved version of locales, notably interpretation of locales.
373 Improved version of HOL-Algebra.
375 * 2004/2005: Amine Chaieb, TUM
376 Improved version of HOL presburger method.
378 * 2004/2005: Steven Obua, TUM
379 Improved version of HOL/Import, support for HOL-Light.
380 Improved version of HOL-Complex-Matrix.
381 Pure/defs: more sophisticated checks on well-formedness of overloading.
382 Pure/Tools: an experimental evaluator for lambda terms.
384 * 2004/2005: Norbert Schirmer, TUM
385 Contributions to document 'sugar'.
386 Improved version of HOL/record.
388 * 2004/2005: Sebastian Skalberg, TUM
389 Improved version of HOL/Import.
390 Some internal ML reorganizations.
392 * 2004/2005: Tjark Weber, TUM
393 SAT solver method using zChaff.
394 Improved version of HOL/refute.