Thu, 30 Oct 1997 11:43:32 +0100 PureThy.add_store_defs_i, PureThy.add_store_axioms;
wenzelm [Thu, 30 Oct 1997 11:43:32 +0100] rev 4040
PureThy.add_store_defs_i, PureThy.add_store_axioms;
Thu, 30 Oct 1997 11:19:57 +0100 fixed try_dest_adm;
wenzelm [Thu, 30 Oct 1997 11:19:57 +0100] rev 4039
fixed try_dest_adm; tuned;
Thu, 30 Oct 1997 10:50:04 +0100 added adm.ML;
wenzelm [Thu, 30 Oct 1997 10:50:04 +0100] rev 4038
added adm.ML;
Thu, 30 Oct 1997 10:01:46 +0100 tuned;
wenzelm [Thu, 30 Oct 1997 10:01:46 +0100] rev 4037
tuned;
Thu, 30 Oct 1997 09:59:38 +0100 tuned simp trace;
wenzelm [Thu, 30 Oct 1997 09:59:38 +0100] rev 4036
tuned simp trace;
Thu, 30 Oct 1997 09:54:47 +0100 *** empty log message ***
nipkow [Thu, 30 Oct 1997 09:54:47 +0100] rev 4035
*** empty log message ***
Thu, 30 Oct 1997 09:47:26 +0100 Removed spurious blank.
nipkow [Thu, 30 Oct 1997 09:47:26 +0100] rev 4034
Removed spurious blank. Updated proof because of HOL change.
Thu, 30 Oct 1997 09:46:11 +0100 Updated proofs
nipkow [Thu, 30 Oct 1997 09:46:11 +0100] rev 4033
Updated proofs
Thu, 30 Oct 1997 09:45:03 +0100 For each datatype `t' there is now a theorem `split_t_case' of the form
nipkow [Thu, 30 Oct 1997 09:45:03 +0100] rev 4032
For each datatype `t' there is now a theorem `split_t_case' of the form P(t_case f1 ... fn x) = ((!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1))& ... (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))) The simplifier now reduces !x. (..x.. & x = t & ..x..) --> P x to (..t.. & ..t..) --> P t (and similarly for t=x).
Wed, 29 Oct 1997 16:03:19 +0100 fixed spaces in qed;
wenzelm [Wed, 29 Oct 1997 16:03:19 +0100] rev 4031
fixed spaces in qed;
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip