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 Isabelle 2007
8 ------------------------------
10 * June 2007: Amine Chaieb, TUM
11 Semiring normalization and Groebner Bases
13 * June 2007: Joe Hurd, Oxford
16 * 2006/2007: Kong W. Susanto, Cambridge
17 HOL: Metis prover integration.
19 * 2006/2007: Florian Haftmann, TUM
20 Pure: generic code generator framework.
22 HOL: theory tuning, code generator setup.
24 * November 2006: Lukas Bulwahn, TUM
25 HOL/function: method "lexicographic_order".
27 * October 2006: Stefan Hohe, TUM
28 HOL-Algebra: ideals and quotients over rings.
30 * August 2006: Amine Chaieb, TUM
31 Experimental support for generic reflection and reification in HOL.
33 * July 2006: Rafal Kolanski, NICTA
34 Hex (0xFF) and binary (0b1011) numerals.
36 * May 2006: Klaus Aehlig, LMU
37 Command 'normal_form': normalization by evaluation.
39 * May 2006: Amine Chaieb, TUM
40 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
43 * February 2006: Benjamin Porter, NICTA
44 HOL and HOL-Complex: generalised mean value theorem, continuum is
45 not denumerable, harmonic and arithmetic series, and denumerability
48 * October 2005: Martin Wildmoser, TUM
49 Sketch for Isar 'guess' element.
52 Contributions to Isabelle 2005
53 ------------------------------
55 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
56 HOL-Complex: Formalization of Taylor series.
58 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
59 Components for SAT solver method using zChaff.
61 * September 2005: Ning Zhang and Christian Urban, LMU Munich
64 * September 2005: Bernhard Haeupler, TUM
65 Method comm_ring for proving equalities in commutative rings.
67 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
68 Various improvements of the HOL and HOL-Complex library.
70 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
71 Some structured proofs about completeness of real numbers.
73 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
74 Improved retrieval of facts from theory/proof context.
76 * February 2005: Lucas Dixon, University of Edinburgh
77 Improved subst method.
79 * 2005: Brian Huffman, OGI
80 Various improvements of HOLCF.
81 Some improvements of the HOL-Complex library.
83 * 2005: Claire Quigley and Jia Meng, University of Cambridge
84 Some support for asynchronous communication with external provers
87 * 2005: Florian Haftmann, TUM
88 Contributions to document 'sugar'.
89 Various ML combinators, notably linear functional transformations.
90 Some cleanup of ML legacy.
91 Additional antiquotations.
92 Improved Isabelle web site.
94 * 2004/2005: David Aspinall, University of Edinburgh
95 Various elements of XML and PGIP based communication with user
96 interfaces (experimental).
98 * 2004/2005: Gerwin Klein, NICTA
99 Contributions to document 'sugar'.
100 Improved Isabelle web site.
101 Improved HTML presentation of theories.
103 * 2004/2005: Clemens Ballarin, TUM
104 Provers: tools for transitive relations and quasi orders.
105 Improved version of locales, notably interpretation of locales.
106 Improved version of HOL-Algebra.
108 * 2004/2005: Amine Chaieb, TUM
109 Improved version of HOL presburger method.
111 * 2004/2005: Steven Obua, TUM
112 Improved version of HOL/Import, support for HOL-Light.
113 Improved version of HOL-Complex-Matrix.
114 Pure/defs: more sophisticated checks on well-formedness of overloading.
115 Pure/Tools: an experimental evaluator for lambda terms.
117 * 2004/2005: Norbert Schirmer, TUM
118 Contributions to document 'sugar'.
119 Improved version of HOL/record.
121 * 2004/2005: Sebastian Skalberg, TUM
122 Improved version of HOL/Import.
123 Some internal ML reorganizations.
125 * 2004/2005: Tjark Weber, TUM
126 SAT solver method using zChaff.
127 Improved version of HOL/refute.