more robust build error handling, e.g. missing outer syntax commands;
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 --------------------------------------
9 * Feb. 2013: Florian Haftmann, TUM
10 Reworking and consolidation of code generation for target
13 * Feb. 2013: Florian Haftmann, TUM
14 Sieve of Eratosthenes.
17 Contributions to Isabelle2013
18 -----------------------------
20 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
21 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
23 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
24 Jasmin Blanchette, TUM
25 Implemented Machine Learning for Sledgehammer (MaSh).
27 * Fall 2012: Steffen Smolka, TUM
28 Various improvements to Sledgehammer's Isar proof generator,
29 including a smart type annotation algorithm and proof shrinking.
31 * December 2012: Alessandro Coglio, Kestrel
32 Contributions to HOL's Lattice library.
34 * November 2012: Fabian Immler, TUM
35 "Symbols" dockable for Isabelle/jEdit.
37 * November 2012: Fabian Immler, TUM
38 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
39 of projective families.
41 * October 2012: Andreas Lochbihler, KIT
42 Efficient construction of red-black trees from sorted associative
45 * September 2012: Florian Haftmann, TUM
46 Lattice instances for type option.
48 * September 2012: Christian Sternagel, JAIST
49 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
50 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
52 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
53 New BNF-based (co)datatype package.
55 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
56 Theories of ordinals and cardinals.
58 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
59 Advanced support for Isabelle sessions and build management, notably
62 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
63 Simproc for rewriting set comprehensions into pointfree expressions.
65 * May 2012: Andreas Lochbihler, KIT
66 Theory of almost everywhere constant functions.
68 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
69 Graphview in Scala/Swing.
72 Contributions to Isabelle2012
73 -----------------------------
75 * April 2012: Johannes Hölzl, TUM
76 Probability: Introduced type to represent measures instead of
79 * April 2012: Johannes Hölzl, Fabian Immler, TUM
80 Float: Moved to Dyadic rationals to represent floating point numers.
82 * April 2012: Thomas Sewell, NICTA and
83 2010: Sascha Boehme, TUM
84 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
85 equalities/inequalities.
87 * March 2012: Christian Sternagel, JAIST
88 Consolidated theory of relation composition.
90 * March 2012: Nik Sultana, University of Cambridge
91 HOL/TPTP parser and import facilities.
93 * March 2012: Cezary Kaliszyk, University of Innsbruck and
94 Alexander Krauss, QAware GmbH
95 Faster and more scalable Import mechanism for HOL Light proofs.
97 * January 2012: Florian Haftmann, TUM, et al.
98 (Re-)Introduction of the "set" type constructor.
100 * 2012: Ondrej Kuncar, TUM
101 New package Lifting, various improvements and refinements to the
104 * 2011/2012: Jasmin Blanchette, TUM
105 Various improvements to Sledgehammer, notably: tighter integration
106 with SPASS, support for more provers (Alt-Ergo, iProver,
109 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
110 Various refinements of local theory infrastructure.
111 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
114 Contributions to Isabelle2011-1
115 -------------------------------
117 * September 2011: Peter Gammie
118 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
120 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
121 Refined theory on complete lattices.
123 * August 2011: Brian Huffman, Portland State University
124 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
126 * June 2011: Brian Huffman, Portland State University
127 Proof method "countable_datatype" for theory Library/Countable.
129 * 2011: Jasmin Blanchette, TUM
130 Various improvements to Sledgehammer, notably: use of sound
131 translations, support for more provers (Waldmeister, LEO-II,
132 Satallax). Further development of Nitpick and 'try' command.
134 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
135 Theory HOL/Library/Cset_Monad allows do notation for computable sets
136 (cset) via the generic monad ad-hoc overloading facility.
138 * 2011: Johannes Hölzl, Armin Heller, TUM and
139 Bogdan Grechuk, University of Edinburgh
140 Theory HOL/Library/Extended_Reals: real numbers extended with plus
143 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
144 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
148 Contributions to Isabelle2011
149 -----------------------------
151 * January 2011: Stefan Berghofer, secunet Security Networks AG
152 HOL-SPARK: an interactive prover back-end for SPARK.
154 * October 2010: Bogdan Grechuk, University of Edinburgh
155 Extended convex analysis in Multivariate Analysis.
157 * October 2010: Dmitriy Traytel, TUM
158 Coercive subtyping via subtype constraints.
160 * October 2010: Alexander Krauss, TUM
161 Command partial_function for function definitions based on complete
162 partial orders in HOL.
164 * September 2010: Florian Haftmann, TUM
165 Refined concepts for evaluation, i.e., normalization of terms using
166 different techniques.
168 * September 2010: Florian Haftmann, TUM
169 Code generation for Scala.
171 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
172 Improved Probability theory in HOL.
174 * July 2010: Florian Haftmann, TUM
175 Reworking and extension of the Imperative HOL framework.
177 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
179 Ad-hoc overloading. Generic do notation for monads.
182 Contributions to Isabelle2009-2
183 -------------------------------
185 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
186 Makarius Wenzel, TUM / LRI
187 Elimination of type classes from proof terms.
189 * April 2010: Florian Haftmann, TUM
190 Reorganization of abstract algebra type classes.
192 * April 2010: Florian Haftmann, TUM
193 Code generation for data representations involving invariants;
194 various collections avaiable in theories Fset, Dlist, RBT,
195 Mapping and AssocList.
197 * March 2010: Sascha Boehme, TUM
198 Efficient SHA1 library for Poly/ML.
200 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
201 Quotient type package for Isabelle/HOL.
204 Contributions to Isabelle2009-1
205 -------------------------------
207 * November 2009, Brian Huffman, PSU
208 New definitional domain package for HOLCF.
210 * November 2009: Robert Himmelmann, TUM
211 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
213 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
214 A tabled implementation of the reflexive transitive closure.
216 * November 2009: Lukas Bulwahn, TUM
217 Predicate Compiler: a compiler for inductive predicates to
218 equational specifications.
220 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
221 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
223 * October 2009: Jasmin Blanchette, TUM
224 Nitpick: yet another counterexample generator for Isabelle/HOL.
226 * October 2009: Sascha Boehme, TUM
227 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
229 * October 2009: Florian Haftmann, TUM
230 Refinement of parts of the HOL datatype package.
232 * October 2009: Florian Haftmann, TUM
233 Generic term styles for term antiquotations.
235 * September 2009: Thomas Sewell, NICTA
236 More efficient HOL/record implementation.
238 * September 2009: Sascha Boehme, TUM
239 SMT method using external SMT solvers.
241 * September 2009: Florian Haftmann, TUM
242 Refinement of sets and lattices.
244 * July 2009: Jeremy Avigad and Amine Chaieb
247 * July 2009: Philipp Meyer, TUM
248 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
251 * July 2009: Florian Haftmann, TUM
252 New quickcheck implementation using new code generator.
254 * July 2009: Florian Haftmann, TUM
255 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
258 * June 2009: Florian Haftmann, TUM
259 HOL/Library/Tree: search trees implementing mappings, ready to use
262 * March 2009: Philipp Meyer, TUM
263 Minimization tool for results from Sledgehammer.
266 Contributions to Isabelle2009
267 -----------------------------
269 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
271 Elementary topology in Euclidean space.
273 * March 2009: Johannes Hoelzl, TUM
274 Method "approximation", which proves real valued inequalities by
277 * February 2009: Filip Maric, Univ. of Belgrade
280 * February 2009: Jasmin Christian Blanchette, TUM
281 Misc cleanup of HOL/refute.
283 * February 2009: Timothy Bourke, NICTA
284 New find_consts command.
286 * February 2009: Timothy Bourke, NICTA
287 "solves" criterion for find_theorems and auto_solve option
289 * December 2008: Clemens Ballarin, TUM
290 New locale implementation.
292 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
293 Method "sizechange" for advanced termination proofs.
295 * November 2008: Timothy Bourke, NICTA
296 Performance improvement (factor 50) for find_theorems.
298 * 2008: Florian Haftmann, TUM
299 Various extensions and restructurings in HOL, improvements
300 in evaluation mechanisms, new module binding.ML for name bindings.
302 * October 2008: Fabian Immler, TUM
303 ATP manager for Sledgehammer, based on ML threads instead of Posix
304 processes. Additional ATP wrappers, including remote SystemOnTPTP
307 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
308 Prover for coherent logic.
310 * August 2008: Fabian Immler, TUM
311 Vampire wrapper script for remote SystemOnTPTP service.
314 Contributions to Isabelle2008
315 -----------------------------
318 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
319 HOL library improvements.
321 * 2007/2008: Brian Huffman, PSU
322 HOLCF library improvements.
324 * 2007/2008: Stefan Berghofer, TUM
325 HOL-Nominal package improvements.
327 * March 2008: Markus Reiter, TUM
328 HOL/Library/RBT: red-black trees.
330 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
331 Lukas Bulwahn, TUM and John Matthews, Galois:
332 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
335 * December 2007: Norbert Schirmer, Uni Saarbruecken
336 Misc improvements of record package in HOL.
338 * December 2007: Florian Haftmann, TUM
339 Overloading and class instantiation target.
341 * December 2007: Florian Haftmann, TUM
342 New version of primrec package for local theories.
344 * December 2007: Alexander Krauss, TUM
345 Method "induction_scheme" in HOL.
347 * November 2007: Peter Lammich, Uni Muenster
348 HOL-Lattice: some more lemmas.
351 Contributions to Isabelle2007
352 -----------------------------
354 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
355 State Spaces: The Locale Way (in HOL).
357 * October 2007: Mark A. Hillebrand, DFKI
358 Robust sub/superscripts in LaTeX document output.
360 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
361 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
362 HOL-Word: a library for fixed-size machine words in Isabelle.
364 * August 2007: Brian Huffman, PSU
365 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
367 * June 2007: Amine Chaieb, TUM
368 Semiring normalization and Groebner Bases.
369 Support for dense linear orders.
371 * June 2007: Joe Hurd, Oxford
372 Metis theorem-prover.
374 * 2007: Kong W. Susanto, Cambridge
375 HOL: Metis prover integration.
377 * 2007: Stefan Berghofer, TUM
378 HOL: inductive predicates and sets.
380 * 2007: Norbert Schirmer, TUM
381 HOL/record: misc improvements.
383 * 2006/2007: Alexander Krauss, TUM
384 HOL: function package and related theories on termination.
386 * 2006/2007: Florian Haftmann, TUM
387 Pure: generic code generator framework.
389 HOL: theory reorganization, code generator setup.
391 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
393 HOL/Nominal package and related tools.
395 * November 2006: Lukas Bulwahn, TUM
396 HOL: method "lexicographic_order" for function package.
398 * October 2006: Stefan Hohe, TUM
399 HOL-Algebra: ideals and quotients over rings.
401 * August 2006: Amine Chaieb, TUM
402 Experimental support for generic reflection and reification in HOL.
404 * July 2006: Rafal Kolanski, NICTA
405 Hex (0xFF) and binary (0b1011) numerals.
407 * May 2006: Klaus Aehlig, LMU
408 Command 'normal_form': normalization by evaluation.
410 * May 2006: Amine Chaieb, TUM
411 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
414 * February 2006: Benjamin Porter, NICTA
415 HOL and HOL-Complex: generalised mean value theorem, continuum is
416 not denumerable, harmonic and arithmetic series, and denumerability
419 * October 2005: Martin Wildmoser, TUM
420 Sketch for Isar 'guess' element.
423 Contributions to Isabelle2005
424 -----------------------------
426 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
427 HOL-Complex: Formalization of Taylor series.
429 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
430 Components for SAT solver method using zChaff.
432 * September 2005: Ning Zhang and Christian Urban, LMU Munich
435 * September 2005: Bernhard Haeupler, TUM
436 Method comm_ring for proving equalities in commutative rings.
438 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
439 Various improvements of the HOL and HOL-Complex library.
441 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
442 Some structured proofs about completeness of real numbers.
444 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
445 Improved retrieval of facts from theory/proof context.
447 * February 2005: Lucas Dixon, University of Edinburgh
448 Improved subst method.
450 * 2005: Brian Huffman, OGI
451 Various improvements of HOLCF.
452 Some improvements of the HOL-Complex library.
454 * 2005: Claire Quigley and Jia Meng, University of Cambridge
455 Some support for asynchronous communication with external provers
458 * 2005: Florian Haftmann, TUM
459 Contributions to document 'sugar'.
460 Various ML combinators, notably linear functional transformations.
461 Some cleanup of ML legacy.
462 Additional antiquotations.
463 Improved Isabelle web site.
465 * 2004/2005: David Aspinall, University of Edinburgh
466 Various elements of XML and PGIP based communication with user
467 interfaces (experimental).
469 * 2004/2005: Gerwin Klein, NICTA
470 Contributions to document 'sugar'.
471 Improved Isabelle web site.
472 Improved HTML presentation of theories.
474 * 2004/2005: Clemens Ballarin, TUM
475 Provers: tools for transitive relations and quasi orders.
476 Improved version of locales, notably interpretation of locales.
477 Improved version of HOL-Algebra.
479 * 2004/2005: Amine Chaieb, TUM
480 Improved version of HOL presburger method.
482 * 2004/2005: Steven Obua, TUM
483 Improved version of HOL/Import, support for HOL-Light.
484 Improved version of HOL-Complex-Matrix.
485 Pure/defs: more sophisticated checks on well-formedness of overloading.
486 Pure/Tools: an experimental evaluator for lambda terms.
488 * 2004/2005: Norbert Schirmer, TUM
489 Contributions to document 'sugar'.
490 Improved version of HOL/record.
492 * 2004/2005: Sebastian Skalberg, TUM
493 Improved version of HOL/Import.
494 Some internal ML reorganizations.
496 * 2004/2005: Tjark Weber, TUM
497 SAT solver method using zChaff.
498 Improved version of HOL/refute.