oheimb [Thu, 30 Oct 1997 14:17:33 +0100] rev 4041
domain package:
* theorems are stored in the theory
* creates hierachical name space
* minor changes to some names and values (for consistency),
e.g. cases -> casedist, dists_eq -> dist_eqs,
[take_lemma] -> take_lemmas
* separator between mutual domain definitions changed from "," to "and"
* minor debugging of Domain_Library.mk_var_names
wenzelm [Thu, 30 Oct 1997 11:43:32 +0100] rev 4040
PureThy.add_store_defs_i, PureThy.add_store_axioms;
wenzelm [Thu, 30 Oct 1997 11:19:57 +0100] rev 4039
fixed try_dest_adm;
tuned;
wenzelm [Thu, 30 Oct 1997 10:50:04 +0100] rev 4038
added adm.ML;
wenzelm [Thu, 30 Oct 1997 10:01:46 +0100] rev 4037
tuned;
wenzelm [Thu, 30 Oct 1997 09:59:38 +0100] rev 4036
tuned simp trace;
nipkow [Thu, 30 Oct 1997 09:54:47 +0100] rev 4035
*** empty log message ***
nipkow [Thu, 30 Oct 1997 09:47:26 +0100] rev 4034
Removed spurious blank.
Updated proof because of HOL change.
nipkow [Thu, 30 Oct 1997 09:46:11 +0100] rev 4033
Updated proofs
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).