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 --------------------------------------
11 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
12 HOL library improvements.
14 * 2007/2008: Brian Huffman, PSU
15 HOLCF library improvements.
17 * 2007/2008: Stefan Berghofer, TUM
18 HOL-Nominal package improvements.
20 * March 2008: Markus Reiter, TUM
21 HOL/Library/RBT: red-black trees.
23 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
24 Lukas Bulwahn, TUM and John Matthews, Galois:
25 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
28 * December 2007: Norbert Schirmer, Uni Saarbruecken
29 Misc improvements of record package in HOL.
31 * December 2007: Florian Haftmann, TUM
32 Overloading and class instantiation target.
34 * December 2007: Florian Haftmann, TUM
35 New version of primrec package for local theories.
37 * December 2007: Alexander Krauss, TUM
38 Method "induction_scheme" in HOL.
40 * November 2007: Peter Lammich, Uni Muenster
41 HOL-Lattice: some more lemmas.
44 Contributions to Isabelle2007
45 -----------------------------
47 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
48 State Spaces: The Locale Way (in HOL).
50 * October 2007: Mark A. Hillebrand, DFKI
51 Robust sub/superscripts in LaTeX document output.
53 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
54 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
55 HOL-Word: a library for fixed-size machine words in Isabelle.
57 * August 2007: Brian Huffman, PSU
58 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
60 * June 2007: Amine Chaieb, TUM
61 Semiring normalization and Groebner Bases.
62 Support for dense linear orders.
64 * June 2007: Joe Hurd, Oxford
67 * 2007: Kong W. Susanto, Cambridge
68 HOL: Metis prover integration.
70 * 2007: Stefan Berghofer, TUM
71 HOL: inductive predicates and sets.
73 * 2007: Norbert Schirmer, TUM
74 HOL/record: misc improvements.
76 * 2006/2007: Alexander Krauss, TUM
77 HOL: function package and related theories on termination.
79 * 2006/2007: Florian Haftmann, TUM
80 Pure: generic code generator framework.
82 HOL: theory reorganization, code generator setup.
84 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
86 HOL/Nominal package and related tools.
88 * November 2006: Lukas Bulwahn, TUM
89 HOL: method "lexicographic_order" for function package.
91 * October 2006: Stefan Hohe, TUM
92 HOL-Algebra: ideals and quotients over rings.
94 * August 2006: Amine Chaieb, TUM
95 Experimental support for generic reflection and reification in HOL.
97 * July 2006: Rafal Kolanski, NICTA
98 Hex (0xFF) and binary (0b1011) numerals.
100 * May 2006: Klaus Aehlig, LMU
101 Command 'normal_form': normalization by evaluation.
103 * May 2006: Amine Chaieb, TUM
104 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
107 * February 2006: Benjamin Porter, NICTA
108 HOL and HOL-Complex: generalised mean value theorem, continuum is
109 not denumerable, harmonic and arithmetic series, and denumerability
112 * October 2005: Martin Wildmoser, TUM
113 Sketch for Isar 'guess' element.
116 Contributions to Isabelle2005
117 -----------------------------
119 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
120 HOL-Complex: Formalization of Taylor series.
122 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
123 Components for SAT solver method using zChaff.
125 * September 2005: Ning Zhang and Christian Urban, LMU Munich
128 * September 2005: Bernhard Haeupler, TUM
129 Method comm_ring for proving equalities in commutative rings.
131 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
132 Various improvements of the HOL and HOL-Complex library.
134 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
135 Some structured proofs about completeness of real numbers.
137 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
138 Improved retrieval of facts from theory/proof context.
140 * February 2005: Lucas Dixon, University of Edinburgh
141 Improved subst method.
143 * 2005: Brian Huffman, OGI
144 Various improvements of HOLCF.
145 Some improvements of the HOL-Complex library.
147 * 2005: Claire Quigley and Jia Meng, University of Cambridge
148 Some support for asynchronous communication with external provers
151 * 2005: Florian Haftmann, TUM
152 Contributions to document 'sugar'.
153 Various ML combinators, notably linear functional transformations.
154 Some cleanup of ML legacy.
155 Additional antiquotations.
156 Improved Isabelle web site.
158 * 2004/2005: David Aspinall, University of Edinburgh
159 Various elements of XML and PGIP based communication with user
160 interfaces (experimental).
162 * 2004/2005: Gerwin Klein, NICTA
163 Contributions to document 'sugar'.
164 Improved Isabelle web site.
165 Improved HTML presentation of theories.
167 * 2004/2005: Clemens Ballarin, TUM
168 Provers: tools for transitive relations and quasi orders.
169 Improved version of locales, notably interpretation of locales.
170 Improved version of HOL-Algebra.
172 * 2004/2005: Amine Chaieb, TUM
173 Improved version of HOL presburger method.
175 * 2004/2005: Steven Obua, TUM
176 Improved version of HOL/Import, support for HOL-Light.
177 Improved version of HOL-Complex-Matrix.
178 Pure/defs: more sophisticated checks on well-formedness of overloading.
179 Pure/Tools: an experimental evaluator for lambda terms.
181 * 2004/2005: Norbert Schirmer, TUM
182 Contributions to document 'sugar'.
183 Improved version of HOL/record.
185 * 2004/2005: Sebastian Skalberg, TUM
186 Improved version of HOL/Import.
187 Some internal ML reorganizations.
189 * 2004/2005: Tjark Weber, TUM
190 SAT solver method using zChaff.
191 Improved version of HOL/refute.