merged, using src/HOL/Tools/Sledgehammer/sledgehammer_isar.ML and src/HOL/Tools/Sledgehammer/sledgehammer_run.ML from 347c3b0cab44;
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 --------------------------------------
10 Contributions to Isabelle2013-1
11 -------------------------------
13 * September 2013: Lars Noschinski, TUM
14 Conversion between function definitions as list of equations and
15 case expressions in HOL.
16 New library Simps_Case_Conv with commands case_of_simps,
19 * September 2013: Nik Sultana, University of Cambridge
20 Improvements to HOL/TPTP parser and import facilities.
22 * September 2013: Johannes Hölzl and Dmitriy Traytel, TUM
23 New "coinduction" method (residing in HOL-BNF) to avoid boilerplate.
25 * Summer 2013: Makarius Wenzel, Université Paris-Sud / LRI
26 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
28 * Summer 2013: Manuel Eberl, TUM
29 Generation of elimination rules in the function package.
30 New command "fun_cases".
32 * Summer 2013: Christian Sternagel, JAIST
33 Improved support for ad hoc overloading of constants, including
34 documentation and examples.
36 * Spring and Summer 2013: Lorenz Panny, Dmitriy Traytel, and
37 Jasmin Blanchette, TUM
38 Various improvements to BNF-based (co)datatype package, including
39 "primrec_new" and "primcorec" commands and a compatibility layer.
41 * Spring and Summer 2013: Ondrej Kuncar, TUM
42 Various improvements of Lifting and Transfer packages.
44 * Spring 2013: Brian Huffman, Galois Inc.
45 Improvements of the Transfer package.
47 * Summer 2013: Daniel Kühlwein, ICIS, Radboud University Nijmegen
48 Jasmin Blanchette, TUM
49 Various improvements to MaSh, including a server mode.
51 * First half of 2013: Steffen Smolka, TUM
52 Further improvements to Sledgehammer's Isar proof generator.
54 * May 2013: Florian Haftmann, TUM
55 Ephemeral interpretation in local theories.
57 * May 2013: Lukas Bulwahn and Nicolai Schaffroth, TUM
58 Spec_Check: A Quickcheck tool for Isabelle/ML.
60 * April 2013: Stefan Berghofer, secunet Security Networks AG
62 Makarius Wenzel, Université Paris-Sud / LRI
63 Case translations as a separate check phase independent of the
66 * March 2013: Florian Haftmann, TUM
67 Reform of "big operators" on sets.
69 * March 2013: Florian Haftmann, TUM
70 Algebraic locale hierarchy for orderings and (semi)lattices.
72 * February 2013: Florian Haftmann, TUM
73 Reworking and consolidation of code generation for target language
76 * February 2013: Florian Haftmann, TUM
77 Sieve of Eratosthenes.
80 Contributions to Isabelle2013
81 -----------------------------
83 * 2012: Makarius Wenzel, Université Paris-Sud / LRI
84 Improvements of Isabelle/Scala and Isabelle/jEdit Prover IDE.
86 * Fall 2012: Daniel Kühlwein, ICIS, Radboud University Nijmegen
87 Jasmin Blanchette, TUM
88 Implemented Machine Learning for Sledgehammer (MaSh).
90 * Fall 2012: Steffen Smolka, TUM
91 Various improvements to Sledgehammer's Isar proof generator,
92 including a smart type annotation algorithm and proof shrinking.
94 * December 2012: Alessandro Coglio, Kestrel
95 Contributions to HOL's Lattice library.
97 * November 2012: Fabian Immler, TUM
98 "Symbols" dockable for Isabelle/jEdit.
100 * November 2012: Fabian Immler, TUM
101 Proof of the Daniell-Kolmogorov theorem: the existence of the limit
102 of projective families.
104 * October 2012: Andreas Lochbihler, KIT
105 Efficient construction of red-black trees from sorted associative
108 * September 2012: Florian Haftmann, TUM
109 Lattice instances for type option.
111 * September 2012: Christian Sternagel, JAIST
112 Consolidated HOL/Library (theories: Prefix_Order, Sublist, and
113 Sublist_Order) w.r.t. prefixes, suffixes, and embedding on lists.
115 * August 2012: Dmitriy Traytel, Andrei Popescu, Jasmin Blanchette, TUM
116 New BNF-based (co)datatype package.
118 * August 2012: Andrei Popescu and Dmitriy Traytel, TUM
119 Theories of ordinals and cardinals.
121 * July 2012: Makarius Wenzel, Université Paris-Sud / LRI
122 Advanced support for Isabelle sessions and build management, notably
125 * June 2012: Felix Kuperjans, Lukas Bulwahn, TUM and Rafal Kolanski, NICTA
126 Simproc for rewriting set comprehensions into pointfree expressions.
128 * May 2012: Andreas Lochbihler, KIT
129 Theory of almost everywhere constant functions.
131 * 2010-2012: Markus Kaiser and Lukas Bulwahn, TUM
132 Graphview in Scala/Swing.
135 Contributions to Isabelle2012
136 -----------------------------
138 * April 2012: Johannes Hölzl, TUM
139 Probability: Introduced type to represent measures instead of
142 * April 2012: Johannes Hölzl, Fabian Immler, TUM
143 Float: Moved to Dyadic rationals to represent floating point numers.
145 * April 2012: Thomas Sewell, NICTA and
146 2010: Sascha Boehme, TUM
147 Theory HOL/Word/WordBitwise: logic/circuit expansion of bitvector
148 equalities/inequalities.
150 * March 2012: Christian Sternagel, JAIST
151 Consolidated theory of relation composition.
153 * March 2012: Nik Sultana, University of Cambridge
154 HOL/TPTP parser and import facilities.
156 * March 2012: Cezary Kaliszyk, University of Innsbruck and
157 Alexander Krauss, QAware GmbH
158 Faster and more scalable Import mechanism for HOL Light proofs.
160 * January 2012: Florian Haftmann, TUM, et al.
161 (Re-)Introduction of the "set" type constructor.
163 * 2012: Ondrej Kuncar, TUM
164 New package Lifting, various improvements and refinements to the
167 * 2011/2012: Jasmin Blanchette, TUM
168 Various improvements to Sledgehammer, notably: tighter integration
169 with SPASS, support for more provers (Alt-Ergo, iProver,
172 * 2011/2012: Makarius Wenzel, Université Paris-Sud / LRI
173 Various refinements of local theory infrastructure.
174 Improvements of Isabelle/Scala layer and Isabelle/jEdit Prover IDE.
177 Contributions to Isabelle2011-1
178 -------------------------------
180 * September 2011: Peter Gammie
181 Theory HOL/Library/Saturated: numbers with saturated arithmetic.
183 * August 2011: Florian Haftmann, Johannes Hölzl and Lars Noschinski, TUM
184 Refined theory on complete lattices.
186 * August 2011: Brian Huffman, Portland State University
187 Miscellaneous cleanup of Complex_Main and Multivariate_Analysis.
189 * June 2011: Brian Huffman, Portland State University
190 Proof method "countable_datatype" for theory Library/Countable.
192 * 2011: Jasmin Blanchette, TUM
193 Various improvements to Sledgehammer, notably: use of sound
194 translations, support for more provers (Waldmeister, LEO-II,
195 Satallax). Further development of Nitpick and 'try' command.
197 * 2011: Andreas Lochbihler, Karlsruhe Institute of Technology
198 Theory HOL/Library/Cset_Monad allows do notation for computable sets
199 (cset) via the generic monad ad-hoc overloading facility.
201 * 2011: Johannes Hölzl, Armin Heller, TUM and
202 Bogdan Grechuk, University of Edinburgh
203 Theory HOL/Library/Extended_Reals: real numbers extended with plus
206 * 2011: Makarius Wenzel, Université Paris-Sud / LRI
207 Various building blocks for Isabelle/Scala layer and Isabelle/jEdit
211 Contributions to Isabelle2011
212 -----------------------------
214 * January 2011: Stefan Berghofer, secunet Security Networks AG
215 HOL-SPARK: an interactive prover back-end for SPARK.
217 * October 2010: Bogdan Grechuk, University of Edinburgh
218 Extended convex analysis in Multivariate Analysis.
220 * October 2010: Dmitriy Traytel, TUM
221 Coercive subtyping via subtype constraints.
223 * October 2010: Alexander Krauss, TUM
224 Command partial_function for function definitions based on complete
225 partial orders in HOL.
227 * September 2010: Florian Haftmann, TUM
228 Refined concepts for evaluation, i.e., normalization of terms using
229 different techniques.
231 * September 2010: Florian Haftmann, TUM
232 Code generation for Scala.
234 * August 2010: Johannes Hoelzl, Armin Heller, and Robert Himmelmann, TUM
235 Improved Probability theory in HOL.
237 * July 2010: Florian Haftmann, TUM
238 Reworking and extension of the Imperative HOL framework.
240 * July 2010: Alexander Krauss, TUM and Christian Sternagel, University
242 Ad-hoc overloading. Generic do notation for monads.
245 Contributions to Isabelle2009-2
246 -------------------------------
248 * 2009/2010: Stefan Berghofer, Alexander Krauss, and Andreas Schropp, TUM,
249 Makarius Wenzel, TUM / LRI
250 Elimination of type classes from proof terms.
252 * April 2010: Florian Haftmann, TUM
253 Reorganization of abstract algebra type classes.
255 * April 2010: Florian Haftmann, TUM
256 Code generation for data representations involving invariants;
257 various collections avaiable in theories Fset, Dlist, RBT,
258 Mapping and AssocList.
260 * March 2010: Sascha Boehme, TUM
261 Efficient SHA1 library for Poly/ML.
263 * February 2010: Cezary Kaliszyk and Christian Urban, TUM
264 Quotient type package for Isabelle/HOL.
267 Contributions to Isabelle2009-1
268 -------------------------------
270 * November 2009, Brian Huffman, PSU
271 New definitional domain package for HOLCF.
273 * November 2009: Robert Himmelmann, TUM
274 Derivation and Brouwer's fixpoint theorem in Multivariate Analysis.
276 * November 2009: Stefan Berghofer and Lukas Bulwahn, TUM
277 A tabled implementation of the reflexive transitive closure.
279 * November 2009: Lukas Bulwahn, TUM
280 Predicate Compiler: a compiler for inductive predicates to
281 equational specifications.
283 * November 2009: Sascha Boehme, TUM and Burkhart Wolff, LRI Paris
284 HOL-Boogie: an interactive prover back-end for Boogie and VCC.
286 * October 2009: Jasmin Blanchette, TUM
287 Nitpick: yet another counterexample generator for Isabelle/HOL.
289 * October 2009: Sascha Boehme, TUM
290 Extension of SMT method: proof-reconstruction for the SMT solver Z3.
292 * October 2009: Florian Haftmann, TUM
293 Refinement of parts of the HOL datatype package.
295 * October 2009: Florian Haftmann, TUM
296 Generic term styles for term antiquotations.
298 * September 2009: Thomas Sewell, NICTA
299 More efficient HOL/record implementation.
301 * September 2009: Sascha Boehme, TUM
302 SMT method using external SMT solvers.
304 * September 2009: Florian Haftmann, TUM
305 Refinement of sets and lattices.
307 * July 2009: Jeremy Avigad and Amine Chaieb
310 * July 2009: Philipp Meyer, TUM
311 HOL/Library/Sum_Of_Squares: functionality to call a remote csdp
314 * July 2009: Florian Haftmann, TUM
315 New quickcheck implementation using new code generator.
317 * July 2009: Florian Haftmann, TUM
318 HOL/Library/Fset: an explicit type of sets; finite sets ready to use
321 * June 2009: Florian Haftmann, TUM
322 HOL/Library/Tree: search trees implementing mappings, ready to use
325 * March 2009: Philipp Meyer, TUM
326 Minimization tool for results from Sledgehammer.
329 Contributions to Isabelle2009
330 -----------------------------
332 * March 2009: Robert Himmelmann, TUM and Amine Chaieb, University of
334 Elementary topology in Euclidean space.
336 * March 2009: Johannes Hoelzl, TUM
337 Method "approximation", which proves real valued inequalities by
340 * February 2009: Filip Maric, Univ. of Belgrade
343 * February 2009: Jasmin Christian Blanchette, TUM
344 Misc cleanup of HOL/refute.
346 * February 2009: Timothy Bourke, NICTA
347 New find_consts command.
349 * February 2009: Timothy Bourke, NICTA
350 "solves" criterion for find_theorems and auto_solve option
352 * December 2008: Clemens Ballarin, TUM
353 New locale implementation.
355 * December 2008: Armin Heller, TUM and Alexander Krauss, TUM
356 Method "sizechange" for advanced termination proofs.
358 * November 2008: Timothy Bourke, NICTA
359 Performance improvement (factor 50) for find_theorems.
361 * 2008: Florian Haftmann, TUM
362 Various extensions and restructurings in HOL, improvements
363 in evaluation mechanisms, new module binding.ML for name bindings.
365 * October 2008: Fabian Immler, TUM
366 ATP manager for Sledgehammer, based on ML threads instead of Posix
367 processes. Additional ATP wrappers, including remote SystemOnTPTP
370 * September 2008: Stefan Berghofer, TUM and Marc Bezem, Univ. Bergen
371 Prover for coherent logic.
373 * August 2008: Fabian Immler, TUM
374 Vampire wrapper script for remote SystemOnTPTP service.
377 Contributions to Isabelle2008
378 -----------------------------
381 Alexander Krauss, TUM and Florian Haftmann, TUM and Stefan Berghofer, TUM
382 HOL library improvements.
384 * 2007/2008: Brian Huffman, PSU
385 HOLCF library improvements.
387 * 2007/2008: Stefan Berghofer, TUM
388 HOL-Nominal package improvements.
390 * March 2008: Markus Reiter, TUM
391 HOL/Library/RBT: red-black trees.
393 * February 2008: Alexander Krauss, TUM and Florian Haftmann, TUM and
394 Lukas Bulwahn, TUM and John Matthews, Galois:
395 HOL/Library/Imperative_HOL: Haskell-style imperative data structures
398 * December 2007: Norbert Schirmer, Uni Saarbruecken
399 Misc improvements of record package in HOL.
401 * December 2007: Florian Haftmann, TUM
402 Overloading and class instantiation target.
404 * December 2007: Florian Haftmann, TUM
405 New version of primrec package for local theories.
407 * December 2007: Alexander Krauss, TUM
408 Method "induction_scheme" in HOL.
410 * November 2007: Peter Lammich, Uni Muenster
411 HOL-Lattice: some more lemmas.
414 Contributions to Isabelle2007
415 -----------------------------
417 * October 2007: Norbert Schirmer, TUM / Uni Saarbruecken
418 State Spaces: The Locale Way (in HOL).
420 * October 2007: Mark A. Hillebrand, DFKI
421 Robust sub/superscripts in LaTeX document output.
423 * August 2007: Jeremy Dawson, NICTA and Paul Graunke, Galois and Brian
424 Huffman, PSU and Gerwin Klein, NICTA and John Matthews, Galois
425 HOL-Word: a library for fixed-size machine words in Isabelle.
427 * August 2007: Brian Huffman, PSU
428 HOL/Library/Boolean_Algebra and HOL/Library/Numeral_Type.
430 * June 2007: Amine Chaieb, TUM
431 Semiring normalization and Groebner Bases.
432 Support for dense linear orders.
434 * June 2007: Joe Hurd, Oxford
435 Metis theorem-prover.
437 * 2007: Kong W. Susanto, Cambridge
438 HOL: Metis prover integration.
440 * 2007: Stefan Berghofer, TUM
441 HOL: inductive predicates and sets.
443 * 2007: Norbert Schirmer, TUM
444 HOL/record: misc improvements.
446 * 2006/2007: Alexander Krauss, TUM
447 HOL: function package and related theories on termination.
449 * 2006/2007: Florian Haftmann, TUM
450 Pure: generic code generator framework.
452 HOL: theory reorganization, code generator setup.
454 * 2006/2007: Christian Urban, TUM and Stefan Berghofer, TUM and
456 HOL/Nominal package and related tools.
458 * November 2006: Lukas Bulwahn, TUM
459 HOL: method "lexicographic_order" for function package.
461 * October 2006: Stefan Hohe, TUM
462 HOL-Algebra: ideals and quotients over rings.
464 * August 2006: Amine Chaieb, TUM
465 Experimental support for generic reflection and reification in HOL.
467 * July 2006: Rafal Kolanski, NICTA
468 Hex (0xFF) and binary (0b1011) numerals.
470 * May 2006: Klaus Aehlig, LMU
471 Command 'normal_form': normalization by evaluation.
473 * May 2006: Amine Chaieb, TUM
474 HOL-Complex: Ferrante and Rackoff Algorithm for linear real
477 * February 2006: Benjamin Porter, NICTA
478 HOL and HOL-Complex: generalised mean value theorem, continuum is
479 not denumerable, harmonic and arithmetic series, and denumerability
482 * October 2005: Martin Wildmoser, TUM
483 Sketch for Isar 'guess' element.
486 Contributions to Isabelle2005
487 -----------------------------
489 * September 2005: Lukas Bulwahn and Bernhard Haeupler, TUM
490 HOL-Complex: Formalization of Taylor series.
492 * September 2005: Stephan Merz, Alwen Tiu, QSL Loria
493 Components for SAT solver method using zChaff.
495 * September 2005: Ning Zhang and Christian Urban, LMU Munich
498 * September 2005: Bernhard Haeupler, TUM
499 Method comm_ring for proving equalities in commutative rings.
501 * July/August 2005: Jeremy Avigad, Carnegie Mellon University
502 Various improvements of the HOL and HOL-Complex library.
504 * July 2005: Florian Zuleger, Johannes Hoelzl, and Simon Funke, TUM
505 Some structured proofs about completeness of real numbers.
507 * May 2005: Rafal Kolanski and Gerwin Klein, NICTA
508 Improved retrieval of facts from theory/proof context.
510 * February 2005: Lucas Dixon, University of Edinburgh
511 Improved subst method.
513 * 2005: Brian Huffman, OGI
514 Various improvements of HOLCF.
515 Some improvements of the HOL-Complex library.
517 * 2005: Claire Quigley and Jia Meng, University of Cambridge
518 Some support for asynchronous communication with external provers
521 * 2005: Florian Haftmann, TUM
522 Contributions to document 'sugar'.
523 Various ML combinators, notably linear functional transformations.
524 Some cleanup of ML legacy.
525 Additional antiquotations.
526 Improved Isabelle web site.
528 * 2004/2005: David Aspinall, University of Edinburgh
529 Various elements of XML and PGIP based communication with user
530 interfaces (experimental).
532 * 2004/2005: Gerwin Klein, NICTA
533 Contributions to document 'sugar'.
534 Improved Isabelle web site.
535 Improved HTML presentation of theories.
537 * 2004/2005: Clemens Ballarin, TUM
538 Provers: tools for transitive relations and quasi orders.
539 Improved version of locales, notably interpretation of locales.
540 Improved version of HOL-Algebra.
542 * 2004/2005: Amine Chaieb, TUM
543 Improved version of HOL presburger method.
545 * 2004/2005: Steven Obua, TUM
546 Improved version of HOL/Import, support for HOL-Light.
547 Improved version of HOL-Complex-Matrix.
548 Pure/defs: more sophisticated checks on well-formedness of overloading.
549 Pure/Tools: an experimental evaluator for lambda terms.
551 * 2004/2005: Norbert Schirmer, TUM
552 Contributions to document 'sugar'.
553 Improved version of HOL/record.
555 * 2004/2005: Sebastian Skalberg, TUM
556 Improved version of HOL/Import.
557 Some internal ML reorganizations.
559 * 2004/2005: Tjark Weber, TUM
560 SAT solver method using zChaff.
561 Improved version of HOL/refute.