Wed, 07 Apr 2010 20:40:42 +0200 boehmes simplified Cache_IO interface (input is just a string and not already stored in a file)
Wed, 07 Apr 2010 20:40:42 +0200 boehmes shortened interface (do not export unused options and functions)
Wed, 07 Apr 2010 20:40:42 +0200 boehmes always unfold definitions of specific constants (including special binders)
Wed, 07 Apr 2010 20:40:42 +0200 boehmes shorten the code by conditional function application
Wed, 07 Apr 2010 20:38:11 +0200 boehmes fail for problems containg the universal sort (as those problems cannot be atomized)
Wed, 07 Apr 2010 19:48:58 +0200 boehmes renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
Wed, 07 Apr 2010 17:24:44 +0200 hoelzl Added Information theory and Example: dining cryptographers
Wed, 07 Apr 2010 11:05:11 +0200 Christian Urban simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
Tue, 06 Apr 2010 11:00:57 +0200 krauss removed (latex output) notation which is sometimes very ugly
Tue, 06 Apr 2010 10:48:16 +0200 boehmes merged
Tue, 06 Apr 2010 10:46:28 +0200 boehmes added missing mult_1_left to linarith simp rules
Tue, 06 Apr 2010 09:27:03 +0200 krauss tuned proof (no induction needed); removed unused lemma and fuzzy comment
Fri, 02 Apr 2010 17:20:43 +0200 wenzelm isatest: basic setup for cygwin-poly on atbroy102;
Thu, 01 Apr 2010 15:37:30 +0200 wenzelm slightly more standard dependencies;
Thu, 01 Apr 2010 12:19:37 +0200 nipkow merged
Thu, 01 Apr 2010 12:19:20 +0200 nipkow tuned many proofs a bit
Thu, 01 Apr 2010 09:31:58 +0200 nipkow merged
Mon, 29 Mar 2010 09:47:21 +0200 nipkow documented [[trace_simp=true]]
Thu, 01 Apr 2010 11:12:08 +0200 blanchet add missing goal argument
Thu, 01 Apr 2010 10:54:21 +0200 blanchet adapt syntax of Sledgehammer options in examples
Thu, 01 Apr 2010 10:27:06 +0200 blanchet merged
Thu, 01 Apr 2010 10:26:45 +0200 blanchet fixed layout of Sledgehammer output
Mon, 29 Mar 2010 19:49:57 +0200 blanchet added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
Mon, 29 Mar 2010 18:44:24 +0200 blanchet make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
Mon, 29 Mar 2010 15:50:18 +0200 blanchet get rid of Polyhash, since it's no longer used
Mon, 29 Mar 2010 15:26:19 +0200 blanchet remove use of Polyhash;
Mon, 29 Mar 2010 14:49:53 +0200 blanchet reintroduce efficient set structure to collect "no_atp" theorems
Mon, 29 Mar 2010 12:21:51 +0200 blanchet made "theory_const" a Sledgehammer option;
Mon, 29 Mar 2010 12:01:00 +0200 blanchet added "respect_no_atp" and "convergence" options to Sledgehammer;
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn adding MREC induction rule in Imperative HOL
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn made smlnj happy
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn adding examples of function predicate replacement and arithmetic examples for the predicate compiler; tuned
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn adopting specialisation examples to moving the alternative defs in the library
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn 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 bulwahn no specialisation for predicates without introduction rules in the predicate compiler
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn improving lookup function to handle overloaded constants more correctly in the function flattening of the predicate compiler
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn activating the signature of Predicate_Compile again which was deactivated in changeset d93a3cb55068 for debugging purposes
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn clarifying the Predicate_Compile_Core signature
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure
Wed, 31 Mar 2010 16:44:41 +0200 bulwahn putting compilation setup of predicate compiler in a separate file
Tue, 30 Mar 2010 15:46:50 -0700 huffman simplify fold_graph proofs
Tue, 30 Mar 2010 23:12:55 +0200 krauss NEWS
Tue, 30 Mar 2010 15:25:35 +0200 krauss removed dead code; fixed typo
Tue, 30 Mar 2010 15:25:30 +0200 krauss switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
Tue, 30 Mar 2010 12:47:39 +0200 wenzelm merged
Mon, 29 Mar 2010 17:30:56 +0200 bulwahn adding skip_proof in the examples because proof procedure cannot handle alternative compilations yet
Mon, 29 Mar 2010 17:30:55 +0200 bulwahn tuned
Mon, 29 Mar 2010 17:30:54 +0200 bulwahn generalized alternative functions to alternative compilation to handle arithmetic functions better
Mon, 29 Mar 2010 17:30:54 +0200 bulwahn correcting alternative functions with tuples
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn no specialisation for patterns with only tuples in the predicate compiler
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn adding registration of functions in the function flattening
Mon, 29 Mar 2010 17:30:53 +0200 bulwahn added book-keeping, registration and compilation with alternative functions for predicates in the predicate compiler
Mon, 29 Mar 2010 17:30:52 +0200 bulwahn adding specialisation examples of the predicate compiler
Mon, 29 Mar 2010 17:30:52 +0200 bulwahn adding specialisation of predicates to the predicate compiler
Mon, 29 Mar 2010 17:30:50 +0200 bulwahn returning an more understandable user error message in the values command
Mon, 29 Mar 2010 17:30:49 +0200 bulwahn adding Lazy_Sequences with explicit depth-bound
Mon, 29 Mar 2010 17:30:48 +0200 bulwahn removing fishing for split thm in the predicate compiler
Mon, 29 Mar 2010 17:30:46 +0200 bulwahn prefer recursive calls before others in the mode inference
Mon, 29 Mar 2010 17:30:45 +0200 bulwahn added statistics to values command for random generation
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip