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 this Isabelle version
8 --------------------------------------
10 * June 2009: Andreas Lochbihler, Uni Karlsruhe
11 HOL/Library/Fin_Fun: almost everywhere constant functions
13 * June 2009: Florian Haftmann, TUM
14 HOL/Library/Tree: searchtrees implementing mappings, ready to use for code generation
16 Contributions to Isabelle2009
17 -----------------------------
19 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
21 Elementary topology in Euclidean space.
23 * March 2009: Johannes Hoelzl, TUM
24 Method "approximation", which proves real valued inequalities by
27 * February 2009: Filip Maric, Univ. of Belgrade
30 * February 2009: Jasmin Christian Blanchette, TUM
31 Misc cleanup of HOL/refute.
33 * February 2009: Timothy Bourke, NICTA
34 New find_consts command.
36 * February 2009: Timothy Bourke, NICTA
37 "solves" criterion for find_theorems and auto_solve option
39 * December 2008: Clemens Ballarin, TUM
40 New locale implementation.
42 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
43 Method "sizechange" for advanced termination proofs.
45 * November 2008: Timothy Bourke, NICTA
46 Performance improvement (factor 50) for find_theorems.
48 * 2008: Florian Haftmann, TUM
49 Various extensions and restructurings in HOL, improvements
50 in evaluation mechanisms, new module binding.ML for name bindings.
52 * October 2008: Fabian Immler, TUM
53 ATP manager for Sledgehammer, based on ML threads instead of Posix
54 processes. Additional ATP wrappers, including remote SystemOnTPTP
57 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
58 Prover for coherent logic.
60 * August 2008: Fabian Immler, TUM
61 Vampire wrapper script for remote SystemOnTPTP service.
64 Contributions to Isabelle2008
65 -----------------------------
68 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
69 HOL library improvements.
71 * 2007/2008: Brian Huffman, PSU
72 HOLCF library improvements.
74 * 2007/2008: Stefan Berghofer, TUM
75 HOL-Nominal package improvements.
77 * March 2008: Markus Reiter, TUM
78 HOL/Library/RBT: red-black trees.
80 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
81 Lukas Bulwahn, TUM and John Matthews, Galois:
82 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
85 * December 2007: Norbert Schirmer, Uni Saarbruecken
86 Misc improvements of record package in HOL.
88 * December 2007: Florian Haftmann, TUM
89 Overloading and class instantiation target.
91 * December 2007: Florian Haftmann, TUM
92 New version of primrec package for local theories.
94 * December 2007: Alexander Krauss, TUM
95 Method "induction_scheme" in HOL.
97 * November 2007: Peter Lammich, Uni Muenster
98 HOL-Lattice: some more lemmas.
101 Contributions to Isabelle2007
102 -----------------------------
104 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
105 State Spaces: The Locale Way (in HOL).
107 * October 2007: Mark A. Hillebrand, DFKI
108 Robust sub/superscripts in LaTeX document output.
110 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
111 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
112 HOL-Word: a library for fixed-size machine words in Isabelle.
114 * August 2007: Brian Huffman, PSU
115 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
117 * June 2007: Amine Chaieb, TUM
118 Semiring normalization and Groebner Bases.
119 Support for dense linear orders.
121 * June 2007: Joe Hurd, Oxford
122 Metis theorem-prover.
124 * 2007: Kong W. Susanto, Cambridge
125 HOL: Metis prover integration.
127 * 2007: Stefan Berghofer, TUM
128 HOL: inductive predicates and sets.
130 * 2007: Norbert Schirmer, TUM
131 HOL/record: misc improvements.
133 * 2006/2007: Alexander Krauss, TUM
134 HOL: function package and related theories on termination.
136 * 2006/2007: Florian Haftmann, TUM
137 Pure: generic code generator framework.
139 HOL: theory reorganization, code generator setup.
141 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
143 HOL/Nominal package and related tools.
145 * November 2006: Lukas Bulwahn, TUM
146 HOL: method "lexicographic_order" for function package.
148 * October 2006: Stefan Hohe, TUM
149 HOL-Algebra: ideals and quotients over rings.
151 * August 2006: Amine Chaieb, TUM
152 Experimental support for generic reflection and reification in HOL.
154 * July 2006: Rafal Kolanski, NICTA
155 Hex (0xFF) and binary (0b1011) numerals.
157 * May 2006: Klaus Aehlig, LMU
158 Command 'normal_form': normalization by evaluation.
160 * May 2006: Amine Chaieb, TUM
161 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
164 * February 2006: Benjamin Porter, NICTA
165 HOL and HOL-Complex: generalised mean value theorem, continuum is
166 not denumerable, harmonic and arithmetic series, and denumerability
169 * October 2005: Martin Wildmoser, TUM
170 Sketch for Isar 'guess' element.
173 Contributions to Isabelle2005
174 -----------------------------
176 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
177 HOL-Complex: Formalization of Taylor series.
179 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
180 Components for SAT solver method using zChaff.
182 * September 2005: Ning Zhang and Christian Urban, LMU Munich
185 * September 2005: Bernhard Haeupler, TUM
186 Method comm_ring for proving equalities in commutative rings.
188 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
189 Various improvements of the HOL and HOL-Complex library.
191 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
192 Some structured proofs about completeness of real numbers.
194 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
195 Improved retrieval of facts from theory/proof context.
197 * February 2005: Lucas Dixon, University of Edinburgh
198 Improved subst method.
200 * 2005: Brian Huffman, OGI
201 Various improvements of HOLCF.
202 Some improvements of the HOL-Complex library.
204 * 2005: Claire Quigley and Jia Meng, University of Cambridge
205 Some support for asynchronous communication with external provers
208 * 2005: Florian Haftmann, TUM
209 Contributions to document 'sugar'.
210 Various ML combinators, notably linear functional transformations.
211 Some cleanup of ML legacy.
212 Additional antiquotations.
213 Improved Isabelle web site.
215 * 2004/2005: David Aspinall, University of Edinburgh
216 Various elements of XML and PGIP based communication with user
217 interfaces (experimental).
219 * 2004/2005: Gerwin Klein, NICTA
220 Contributions to document 'sugar'.
221 Improved Isabelle web site.
222 Improved HTML presentation of theories.
224 * 2004/2005: Clemens Ballarin, TUM
225 Provers: tools for transitive relations and quasi orders.
226 Improved version of locales, notably interpretation of locales.
227 Improved version of HOL-Algebra.
229 * 2004/2005: Amine Chaieb, TUM
230 Improved version of HOL presburger method.
232 * 2004/2005: Steven Obua, TUM
233 Improved version of HOL/Import, support for HOL-Light.
234 Improved version of HOL-Complex-Matrix.
235 Pure/defs: more sophisticated checks on well-formedness of overloading.
236 Pure/Tools: an experimental evaluator for lambda terms.
238 * 2004/2005: Norbert Schirmer, TUM
239 Contributions to document 'sugar'.
240 Improved version of HOL/record.
242 * 2004/2005: Sebastian Skalberg, TUM
243 Improved version of HOL/Import.
244 Some internal ML reorganizations.
246 * 2004/2005: Tjark Weber, TUM
247 SAT solver method using zChaff.
248 Improved version of HOL/refute.