oheimb [Fri, 23 Feb 2001 16:31:21 +0100] rev 11181
renamed addaltern to addafter, addSaltern to addSafter
oheimb [Fri, 23 Feb 2001 16:31:18 +0100] rev 11180
removed performance leak for split_conv_tac (and corresponding safe wrapper)
paulson [Thu, 22 Feb 2001 18:13:23 +0100] rev 11179
subst method and a new section on rule, rule_tac, etc
kleing [Thu, 22 Feb 2001 18:03:11 +0100] rev 11178
removed unused constant
kleing [Thu, 22 Feb 2001 11:47:35 +0100] rev 11177
removed unused function
paulson [Thu, 22 Feb 2001 11:31:31 +0100] rev 11176
a PROPER tidy-up
nipkow [Thu, 22 Feb 2001 10:18:41 +0100] rev 11175
recoded function iter with the help of the while-combinator.
paulson [Wed, 21 Feb 2001 15:21:15 +0100] rev 11174
revisions in response to comments by Tobias
paulson [Wed, 21 Feb 2001 12:57:55 +0100] rev 11173
revisions in response to comments by Tobias
oheimb [Wed, 21 Feb 2001 12:07:00 +0100] rev 11172
added split_conv_tac (also to claset()) as an optimization
oheimb [Tue, 20 Feb 2001 18:53:28 +0100] rev 11171
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb [Tue, 20 Feb 2001 18:48:34 +0100] rev 11170
simplified proofs for splitI and splitD, added splitD'
added split_conv_tac (also to claset()) as an optimization
made split_all_tac safe introducing safe_full_simp_tac,EXISTING PROOFS MAY FAIL
oheimb [Tue, 20 Feb 2001 18:47:34 +0100] rev 11169
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb [Tue, 20 Feb 2001 18:47:32 +0100] rev 11168
corrected comments on addbefore and addSbefore
oheimb [Tue, 20 Feb 2001 18:47:30 +0100] rev 11167
added same_fstI
oheimb [Tue, 20 Feb 2001 18:47:29 +0100] rev 11166
simplified definition of wrapper bspec
oheimb [Tue, 20 Feb 2001 18:47:27 +0100] rev 11165
added image_cong to default congs of recdef
oheimb [Tue, 20 Feb 2001 18:47:25 +0100] rev 11164
added add_arith (just as hint by now)
oheimb [Tue, 20 Feb 2001 18:47:22 +0100] rev 11163
added rearrange_prems
oheimb [Tue, 20 Feb 2001 18:47:06 +0100] rev 11162
debugging: replaced gen_all by forall_elim_vars_safe
nipkow [Tue, 20 Feb 2001 13:23:58 +0100] rev 11161
*** empty log message ***
nipkow [Tue, 20 Feb 2001 11:27:04 +0100] rev 11160
*** empty log message ***
nipkow [Tue, 20 Feb 2001 10:37:12 +0100] rev 11159
*** empty log message ***
nipkow [Tue, 20 Feb 2001 10:18:26 +0100] rev 11158
*** empty log message ***
nipkow [Sat, 17 Feb 2001 10:43:53 +0100] rev 11157
*** empty log message ***
paulson [Fri, 16 Feb 2001 18:51:19 +0100] rev 11156
fixed the obvious errors Tobias found
paulson [Fri, 16 Feb 2001 18:50:09 +0100] rev 11155
Least_def now refers to LeastM
paulson [Fri, 16 Feb 2001 13:47:06 +0100] rev 11154
for the change to LEAST
paulson [Fri, 16 Feb 2001 13:37:21 +0100] rev 11153
Blast bug fix made old proof too slow
paulson [Fri, 16 Feb 2001 13:29:07 +0100] rev 11152
Blast bug fix: now always duplicates when applying a haz rule,
whether or not new variables are added.
Can now prove theorems such as these:
val prems = Goal "[|P==>Q; P==>~Q|] ==> ~P";
by (blast_tac (claset() addDs prems) 1);
val prems = Goal "[|Q==>P; ~Q==>P|] ==> P";
by (blast_tac (claset() addIs prems) 1);
paulson [Fri, 16 Feb 2001 13:27:56 +0100] rev 11151
Blast bug fix made old proof too slow
paulson [Fri, 16 Feb 2001 13:25:08 +0100] rev 11150
Streamlining for the bug fix in Blast.
MPair_parts now built in using AddSEs, throughout.
nipkow [Fri, 16 Feb 2001 08:27:17 +0100] rev 11149
*** empty log message ***
nipkow [Fri, 16 Feb 2001 08:10:28 +0100] rev 11148
*** empty log message ***
nipkow [Fri, 16 Feb 2001 06:46:20 +0100] rev 11147
*** empty log message ***
wenzelm [Fri, 16 Feb 2001 00:36:21 +0100] rev 11146
tuned;
wenzelm [Thu, 15 Feb 2001 17:18:54 +0100] rev 11145
eliminate get_def;
wenzelm [Thu, 15 Feb 2001 16:12:27 +0100] rev 11144
tuned;
oheimb [Thu, 15 Feb 2001 16:07:57 +0100] rev 11143
Ord.thy/.ML converted to Isar
oheimb [Thu, 15 Feb 2001 16:01:47 +0100] rev 11142
moved inv_image to Relation
nonempty_has_least of Nat.ML -> ex_has_least_nat of Wellfounded_Relations.ML
added wf_linord_ex_has_least,LeastM_nat_lemma,LeastM_natI,LeastM_nat_le
oheimb [Thu, 15 Feb 2001 16:01:34 +0100] rev 11141
supressed some warnings on identical proofstate
moved wellorder_LeastI,wellorder_Least_le,wellorder_not_less_Least
from Nat.ML to Wellfounded_Recursion.ML
added wellorder axclass
oheimb [Thu, 15 Feb 2001 16:01:22 +0100] rev 11140
Ord.thy/.ML converted to Isar
added min_of_mono, max_of_mono, max_leastL, max_leastR to Ord.thy
moved Least_equality from Nat.ML to Ord.thy
added LeastM operator
oheimb [Thu, 15 Feb 2001 16:01:07 +0100] rev 11139
moved wellorder_LeastI,wellorder_Least_le,wellorder_not_less_Least
from Nat.ML to Wellfounded_Recursion.ML
moved Least_equality from Nat.ML to Ord.thy
moved wf_less from Nat.ML to NatDef.ML
added wellorder axclass
nonempty_has_least of Nat.ML -> ex_has_least_nat of Wellfounded_Relations.ML
added min_of_mono, max_of_mono, max_leastL, max_leastR to Ord.thy
oheimb [Thu, 15 Feb 2001 16:00:44 +0100] rev 11138
simplified proof of Least_mono
oheimb [Thu, 15 Feb 2001 16:00:42 +0100] rev 11137
added wellorder axclass
oheimb [Thu, 15 Feb 2001 16:00:40 +0100] rev 11136
moved inv_image to Relation
oheimb [Thu, 15 Feb 2001 16:00:38 +0100] rev 11135
moved wf_less from Nat.ML to NatDef.ML
oheimb [Thu, 15 Feb 2001 16:00:36 +0100] rev 11134
added nat as instance of new wellorder axclass