ballarin [Tue, 02 Feb 2010 21:23:20 +0100] rev 36090
Clarified invariant; tuned.
ballarin [Mon, 01 Feb 2010 21:59:27 +0100] rev 36089
More mixin tests.
ballarin [Mon, 01 Feb 2010 21:55:00 +0100] rev 36088
Use serial to be more debug friendly.
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36087
buffered output (faster than direct output)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36086
simplified Cache_IO interface (input is just a string and not already stored in a file)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36085
shortened interface (do not export unused options and functions)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36084
always unfold definitions of specific constants (including special binders)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36083
shorten the code by conditional function application
boehmes [Wed, 07 Apr 2010 20:38:11 +0200] rev 36082
fail for problems containg the universal sort (as those problems cannot be atomized)
boehmes [Wed, 07 Apr 2010 19:48:58 +0200] rev 36081
renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
hoelzl [Wed, 07 Apr 2010 17:24:44 +0200] rev 36080
Added Information theory and Example: dining cryptographers
Christian Urban <urbanc@in.tum.de> [Wed, 07 Apr 2010 11:05:11 +0200] rev 36079
simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
krauss [Tue, 06 Apr 2010 11:00:57 +0200] rev 36078
removed (latex output) notation which is sometimes very ugly
boehmes [Tue, 06 Apr 2010 10:48:16 +0200] rev 36077
merged
boehmes [Tue, 06 Apr 2010 10:46:28 +0200] rev 36076
added missing mult_1_left to linarith simp rules
krauss [Tue, 06 Apr 2010 09:27:03 +0200] rev 36075
tuned proof (no induction needed); removed unused lemma and fuzzy comment
wenzelm [Fri, 02 Apr 2010 17:20:43 +0200] rev 36074
isatest: basic setup for cygwin-poly on atbroy102;
wenzelm [Thu, 01 Apr 2010 15:37:30 +0200] rev 36073
slightly more standard dependencies;
nipkow [Thu, 01 Apr 2010 12:19:37 +0200] rev 36072
merged
nipkow [Thu, 01 Apr 2010 12:19:20 +0200] rev 36071
tuned many proofs a bit
nipkow [Thu, 01 Apr 2010 09:31:58 +0200] rev 36070
merged
nipkow [Mon, 29 Mar 2010 09:47:21 +0200] rev 36069
documented [[trace_simp=true]]
blanchet [Thu, 01 Apr 2010 11:12:08 +0200] rev 36068
add missing goal argument
blanchet [Thu, 01 Apr 2010 10:54:21 +0200] rev 36067
adapt syntax of Sledgehammer options in examples
blanchet [Thu, 01 Apr 2010 10:27:06 +0200] rev 36066
merged
blanchet [Thu, 01 Apr 2010 10:26:45 +0200] rev 36065
fixed layout of Sledgehammer output
blanchet [Mon, 29 Mar 2010 19:49:57 +0200] rev 36064
added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
blanchet [Mon, 29 Mar 2010 18:44:24 +0200] rev 36063
make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
blanchet [Mon, 29 Mar 2010 15:50:18 +0200] rev 36062
get rid of Polyhash, since it's no longer used
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.
blanchet [Mon, 29 Mar 2010 14:49:53 +0200] rev 36060
reintroduce efficient set structure to collect "no_atp" theorems
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.
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"
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36057
adding MREC induction rule in Imperative HOL
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36056
made smlnj happy
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
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36054
adopting specialisation examples to moving the alternative defs in the library
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
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36052
no specialisation for predicates without introduction rules in 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
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36050
activating the signature of Predicate_Compile again which was deactivated in changeset d93a3cb55068 for debugging purposes
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36049
adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36048
clarifying the Predicate_Compile_Core signature
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36047
adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36046
putting compilation setup of predicate compiler in a separate file
huffman [Tue, 30 Mar 2010 15:46:50 -0700] rev 36045
simplify fold_graph proofs
krauss [Tue, 30 Mar 2010 23:12:55 +0200] rev 36044
NEWS
krauss [Tue, 30 Mar 2010 15:25:35 +0200] rev 36043
removed dead code; fixed typo
krauss [Tue, 30 Mar 2010 15:25:30 +0200] rev 36042
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
wenzelm [Tue, 30 Mar 2010 12:47:39 +0200] rev 36041
merged
bulwahn [Mon, 29 Mar 2010 17:30:56 +0200] rev 36040
adding skip_proof in the examples because proof procedure cannot handle alternative compilations yet
bulwahn [Mon, 29 Mar 2010 17:30:55 +0200] rev 36039
tuned
bulwahn [Mon, 29 Mar 2010 17:30:54 +0200] rev 36038
generalized alternative functions to alternative compilation to handle arithmetic functions better
bulwahn [Mon, 29 Mar 2010 17:30:54 +0200] rev 36037
correcting alternative functions with tuples
bulwahn [Mon, 29 Mar 2010 17:30:53 +0200] rev 36036
no specialisation for patterns with only tuples in the predicate compiler
bulwahn [Mon, 29 Mar 2010 17:30:53 +0200] rev 36035
adding registration of functions in the function flattening