Mon, 29 Mar 2010 19:49:57 +0200 added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
blanchet [Mon, 29 Mar 2010 19:49:57 +0200] rev 36064
added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
Mon, 29 Mar 2010 18:44:24 +0200 make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
blanchet [Mon, 29 Mar 2010 18:44:24 +0200] rev 36063
make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
Mon, 29 Mar 2010 15:50:18 +0200 get rid of Polyhash, since it's no longer used
blanchet [Mon, 29 Mar 2010 15:50:18 +0200] rev 36062
get rid of Polyhash, since it's no longer used
Mon, 29 Mar 2010 15:26:19 +0200 remove use of Polyhash;
blanchet [Mon, 29 Mar 2010 15:26:19 +0200] rev 36061
remove use of Polyhash; the new code is slightly faster. Also, "subtract_cls" now has canonical argument ordering.
Mon, 29 Mar 2010 14:49:53 +0200 reintroduce efficient set structure to collect "no_atp" theorems
blanchet [Mon, 29 Mar 2010 14:49:53 +0200] rev 36060
reintroduce efficient set structure to collect "no_atp" theorems
Mon, 29 Mar 2010 12:21:51 +0200 made "theory_const" a Sledgehammer option;
blanchet [Mon, 29 Mar 2010 12:21:51 +0200] rev 36059
made "theory_const" a Sledgehammer option; by default, it's true for SPASS and false for the others. This eliminates the need for the "spass_no_tc" ATP, which can be obtained by passing "no_theory_const" instead.
Mon, 29 Mar 2010 12:01:00 +0200 added "respect_no_atp" and "convergence" options to Sledgehammer;
blanchet [Mon, 29 Mar 2010 12:01:00 +0200] rev 36058
added "respect_no_atp" and "convergence" options to Sledgehammer; these were previously hard-coded in "sledgehammer_fact_filter.ML"
Wed, 31 Mar 2010 16:44:41 +0200 adding MREC induction rule in Imperative HOL
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36057
adding MREC induction rule in Imperative HOL
Wed, 31 Mar 2010 16:44:41 +0200 made smlnj happy
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36056
made smlnj happy
Wed, 31 Mar 2010 16:44:41 +0200 adding examples of function predicate replacement and arithmetic examples for the predicate compiler; tuned
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36055
adding examples of function predicate replacement and arithmetic examples for the predicate compiler; tuned
Wed, 31 Mar 2010 16:44:41 +0200 adopting specialisation examples to moving the alternative defs in the library
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36054
adopting specialisation examples to moving the alternative defs in the library
Wed, 31 Mar 2010 16:44:41 +0200 adding setup for handling arithmetic of natural numbers and integers precisely and more efficiently in the predicate compiler; changed alternative size_list definition for predicate compiler
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36053
adding setup for handling arithmetic of natural numbers and integers precisely and more efficiently in the predicate compiler; changed alternative size_list definition for predicate compiler
Wed, 31 Mar 2010 16:44:41 +0200 no specialisation for predicates without introduction rules in the predicate compiler
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36052
no specialisation for predicates without introduction rules in the predicate compiler
Wed, 31 Mar 2010 16:44:41 +0200 improving lookup function to handle overloaded constants more correctly in the function flattening of the predicate compiler
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36051
improving lookup function to handle overloaded constants more correctly in the function flattening of the predicate compiler
(0) -30000 -10000 -3000 -1000 -300 -100 -14 +14 +100 +300 +1000 +3000 +10000 +30000 tip