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 Isabelle2013
7 -----------------------------
9 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
10 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
12 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
13 Jasmin Blanchette, TUM
14 Implemented Machine Learning for Sledgehammer (MaSh).
16 * Fall 2012: Steffen Smolka, TUM
17 Various improvements to Sledgehammer's Isar proof generator,
18 including a smart type annotation algorithm and proof shrinking.
20 * December 2012: Alessandro Coglio, Kestrel
21 Contributions to HOL's Lattice library.
23 * November 2012: Fabian Immler, TUM
24 "Symbols" dockable for Isabelle/jEdit.
26 * November 2012: Fabian Immler, TUM
27 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
28 of projective families.
30 * October 2012: Andreas Lochbihler, KIT
31 Efficient construction of red-black trees from sorted associative
34 * September 2012: Florian Haftmann, TUM
35 Lattice instances for type option.
37 * September 2012: Christian Sternagel, JAIST
38 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
39 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
41 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
42 New BNF-based (co)datatype package.
44 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
45 Theories of ordinals and cardinals.
47 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
48 Advanced support for Isabelle sessions and build management, notably
51 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
52 Simproc for rewriting set comprehensions into pointfree expressions.
54 * May 2012: Andreas Lochbihler, KIT
55 Theory of almost everywhere constant functions.
57 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
58 Graphview in Scala/Swing.
61 Contributions to Isabelle2012
62 -----------------------------
64 * April 2012: Johannes Hölzl, TUM
65 Probability: Introduced type to represent measures instead of
68 * April 2012: Johannes Hölzl, Fabian Immler, TUM
69 Float: Moved to Dyadic rationals to represent floating point numers.
71 * April 2012: Thomas Sewell, NICTA and
72 2010: Sascha Boehme, TUM
73 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
74 equalities/inequalities.
76 * March 2012: Christian Sternagel, JAIST
77 Consolidated theory of relation composition.
79 * March 2012: Nik Sultana, University of Cambridge
80 HOL/TPTP parser and import facilities.
82 * March 2012: Cezary Kaliszyk, University of Innsbruck and
83 Alexander Krauss, QAware GmbH
84 Faster and more scalable Import mechanism for HOL Light proofs.
86 * January 2012: Florian Haftmann, TUM, et al.
87 (Re-)Introduction of the "set" type constructor.
89 * 2012: Ondrej Kuncar, TUM
90 New package Lifting, various improvements and refinements to the
93 * 2011/2012: Jasmin Blanchette, TUM
94 Various improvements to Sledgehammer, notably: tighter integration
95 with SPASS, support for more provers (Alt-Ergo, iProver,
98 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
99 Various refinements of local theory infrastructure.
100 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
103 Contributions to Isabelle2011-1
104 -------------------------------
106 * September 2011: Peter Gammie
107 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
109 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
110 Refined theory on complete lattices.
112 * August 2011: Brian Huffman, Portland State University
113 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
115 * June 2011: Brian Huffman, Portland State University
116 Proof method "countable_datatype" for theory Library/Countable.
118 * 2011: Jasmin Blanchette, TUM
119 Various improvements to Sledgehammer, notably: use of sound
120 translations, support for more provers (Waldmeister, LEO-II,
121 Satallax). Further development of Nitpick and 'try' command.
123 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
124 Theory HOL/Library/Cset_Monad allows do notation for computable sets
125 (cset) via the generic monad ad-hoc overloading facility.
127 * 2011: Johannes Hölzl, Armin Heller, TUM and
128 Bogdan Grechuk, University of Edinburgh
129 Theory HOL/Library/Extended_Reals: real numbers extended with plus
132 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
133 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
137 Contributions to Isabelle2011
138 -----------------------------
140 * January 2011: Stefan Berghofer, secunet Security Networks AG
141 HOL-SPARK: an interactive prover back-end for SPARK.
143 * October 2010: Bogdan Grechuk, University of Edinburgh
144 Extended convex analysis in Multivariate Analysis.
146 * October 2010: Dmitriy Traytel, TUM
147 Coercive subtyping via subtype constraints.
149 * October 2010: Alexander Krauss, TUM
150 Command partial_function for function definitions based on complete
151 partial orders in HOL.
153 * September 2010: Florian Haftmann, TUM
154 Refined concepts for evaluation, i.e., normalization of terms using
155 different techniques.
157 * September 2010: Florian Haftmann, TUM
158 Code generation for Scala.
160 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
161 Improved Probability theory in HOL.
163 * July 2010: Florian Haftmann, TUM
164 Reworking and extension of the Imperative HOL framework.
166 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
168 Ad-hoc overloading. Generic do notation for monads.
171 Contributions to Isabelle2009-2
172 -------------------------------
174 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
175 Makarius Wenzel, TUM / LRI
176 Elimination of type classes from proof terms.
178 * April 2010: Florian Haftmann, TUM
179 Reorganization of abstract algebra type classes.
181 * April 2010: Florian Haftmann, TUM
182 Code generation for data representations involving invariants;
183 various collections avaiable in theories Fset, Dlist, RBT,
184 Mapping and AssocList.
186 * March 2010: Sascha Boehme, TUM
187 Efficient SHA1 library for Poly/ML.
189 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
190 Quotient type package for Isabelle/HOL.
193 Contributions to Isabelle2009-1
194 -------------------------------
196 * November 2009, Brian Huffman, PSU
197 New definitional domain package for HOLCF.
199 * November 2009: Robert Himmelmann, TUM
200 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
202 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
203 A tabled implementation of the reflexive transitive closure.
205 * November 2009: Lukas Bulwahn, TUM
206 Predicate Compiler: a compiler for inductive predicates to
207 equational specifications.
209 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
210 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
212 * October 2009: Jasmin Blanchette, TUM
213 Nitpick: yet another counterexample generator for Isabelle/HOL.
215 * October 2009: Sascha Boehme, TUM
216 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
218 * October 2009: Florian Haftmann, TUM
219 Refinement of parts of the HOL datatype package.
221 * October 2009: Florian Haftmann, TUM
222 Generic term styles for term antiquotations.
224 * September 2009: Thomas Sewell, NICTA
225 More efficient HOL/record implementation.
227 * September 2009: Sascha Boehme, TUM
228 SMT method using external SMT solvers.
230 * September 2009: Florian Haftmann, TUM
231 Refinement of sets and lattices.
233 * July 2009: Jeremy Avigad and Amine Chaieb
236 * July 2009: Philipp Meyer, TUM
237 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
240 * July 2009: Florian Haftmann, TUM
241 New quickcheck implementation using new code generator.
243 * July 2009: Florian Haftmann, TUM
244 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
247 * June 2009: Florian Haftmann, TUM
248 HOL/Library/Tree: search trees implementing mappings, ready to use
251 * March 2009: Philipp Meyer, TUM
252 Minimization tool for results from Sledgehammer.
255 Contributions to Isabelle2009
256 -----------------------------
258 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
260 Elementary topology in Euclidean space.
262 * March 2009: Johannes Hoelzl, TUM
263 Method "approximation", which proves real valued inequalities by
266 * February 2009: Filip Maric, Univ. of Belgrade
269 * February 2009: Jasmin Christian Blanchette, TUM
270 Misc cleanup of HOL/refute.
272 * February 2009: Timothy Bourke, NICTA
273 New find_consts command.
275 * February 2009: Timothy Bourke, NICTA
276 "solves" criterion for find_theorems and auto_solve option
278 * December 2008: Clemens Ballarin, TUM
279 New locale implementation.
281 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
282 Method "sizechange" for advanced termination proofs.
284 * November 2008: Timothy Bourke, NICTA
285 Performance improvement (factor 50) for find_theorems.
287 * 2008: Florian Haftmann, TUM
288 Various extensions and restructurings in HOL, improvements
289 in evaluation mechanisms, new module binding.ML for name bindings.
291 * October 2008: Fabian Immler, TUM
292 ATP manager for Sledgehammer, based on ML threads instead of Posix
293 processes. Additional ATP wrappers, including remote SystemOnTPTP
296 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
297 Prover for coherent logic.
299 * August 2008: Fabian Immler, TUM
300 Vampire wrapper script for remote SystemOnTPTP service.
303 Contributions to Isabelle2008
304 -----------------------------
307 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
308 HOL library improvements.
310 * 2007/2008: Brian Huffman, PSU
311 HOLCF library improvements.
313 * 2007/2008: Stefan Berghofer, TUM
314 HOL-Nominal package improvements.
316 * March 2008: Markus Reiter, TUM
317 HOL/Library/RBT: red-black trees.
319 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
320 Lukas Bulwahn, TUM and John Matthews, Galois:
321 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
324 * December 2007: Norbert Schirmer, Uni Saarbruecken
325 Misc improvements of record package in HOL.
327 * December 2007: Florian Haftmann, TUM
328 Overloading and class instantiation target.
330 * December 2007: Florian Haftmann, TUM
331 New version of primrec package for local theories.
333 * December 2007: Alexander Krauss, TUM
334 Method "induction_scheme" in HOL.
336 * November 2007: Peter Lammich, Uni Muenster
337 HOL-Lattice: some more lemmas.
340 Contributions to Isabelle2007
341 -----------------------------
343 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
344 State Spaces: The Locale Way (in HOL).
346 * October 2007: Mark A. Hillebrand, DFKI
347 Robust sub/superscripts in LaTeX document output.
349 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
350 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
351 HOL-Word: a library for fixed-size machine words in Isabelle.
353 * August 2007: Brian Huffman, PSU
354 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
356 * June 2007: Amine Chaieb, TUM
357 Semiring normalization and Groebner Bases.
358 Support for dense linear orders.
360 * June 2007: Joe Hurd, Oxford
361 Metis theorem-prover.
363 * 2007: Kong W. Susanto, Cambridge
364 HOL: Metis prover integration.
366 * 2007: Stefan Berghofer, TUM
367 HOL: inductive predicates and sets.
369 * 2007: Norbert Schirmer, TUM
370 HOL/record: misc improvements.
372 * 2006/2007: Alexander Krauss, TUM
373 HOL: function package and related theories on termination.
375 * 2006/2007: Florian Haftmann, TUM
376 Pure: generic code generator framework.
378 HOL: theory reorganization, code generator setup.
380 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
382 HOL/Nominal package and related tools.
384 * November 2006: Lukas Bulwahn, TUM
385 HOL: method "lexicographic_order" for function package.
387 * October 2006: Stefan Hohe, TUM
388 HOL-Algebra: ideals and quotients over rings.
390 * August 2006: Amine Chaieb, TUM
391 Experimental support for generic reflection and reification in HOL.
393 * July 2006: Rafal Kolanski, NICTA
394 Hex (0xFF) and binary (0b1011) numerals.
396 * May 2006: Klaus Aehlig, LMU
397 Command 'normal_form': normalization by evaluation.
399 * May 2006: Amine Chaieb, TUM
400 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
403 * February 2006: Benjamin Porter, NICTA
404 HOL and HOL-Complex: generalised mean value theorem, continuum is
405 not denumerable, harmonic and arithmetic series, and denumerability
408 * October 2005: Martin Wildmoser, TUM
409 Sketch for Isar 'guess' element.
412 Contributions to Isabelle2005
413 -----------------------------
415 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
416 HOL-Complex: Formalization of Taylor series.
418 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
419 Components for SAT solver method using zChaff.
421 * September 2005: Ning Zhang and Christian Urban, LMU Munich
424 * September 2005: Bernhard Haeupler, TUM
425 Method comm_ring for proving equalities in commutative rings.
427 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
428 Various improvements of the HOL and HOL-Complex library.
430 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
431 Some structured proofs about completeness of real numbers.
433 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
434 Improved retrieval of facts from theory/proof context.
436 * February 2005: Lucas Dixon, University of Edinburgh
437 Improved subst method.
439 * 2005: Brian Huffman, OGI
440 Various improvements of HOLCF.
441 Some improvements of the HOL-Complex library.
443 * 2005: Claire Quigley and Jia Meng, University of Cambridge
444 Some support for asynchronous communication with external provers
447 * 2005: Florian Haftmann, TUM
448 Contributions to document 'sugar'.
449 Various ML combinators, notably linear functional transformations.
450 Some cleanup of ML legacy.
451 Additional antiquotations.
452 Improved Isabelle web site.
454 * 2004/2005: David Aspinall, University of Edinburgh
455 Various elements of XML and PGIP based communication with user
456 interfaces (experimental).
458 * 2004/2005: Gerwin Klein, NICTA
459 Contributions to document 'sugar'.
460 Improved Isabelle web site.
461 Improved HTML presentation of theories.
463 * 2004/2005: Clemens Ballarin, TUM
464 Provers: tools for transitive relations and quasi orders.
465 Improved version of locales, notably interpretation of locales.
466 Improved version of HOL-Algebra.
468 * 2004/2005: Amine Chaieb, TUM
469 Improved version of HOL presburger method.
471 * 2004/2005: Steven Obua, TUM
472 Improved version of HOL/Import, support for HOL-Light.
473 Improved version of HOL-Complex-Matrix.
474 Pure/defs: more sophisticated checks on well-formedness of overloading.
475 Pure/Tools: an experimental evaluator for lambda terms.
477 * 2004/2005: Norbert Schirmer, TUM
478 Contributions to document 'sugar'.
479 Improved version of HOL/record.
481 * 2004/2005: Sebastian Skalberg, TUM
482 Improved version of HOL/Import.
483 Some internal ML reorganizations.
485 * 2004/2005: Tjark Weber, TUM
486 SAT solver method using zChaff.
487 Improved version of HOL/refute.