wenzelm [Tue, 10 Jan 2006 19:33:27 +0100] rev 18629
Attrib.rule;
urbanc [Tue, 10 Jan 2006 15:23:31 +0100] rev 18628
tuned
urbanc [Tue, 10 Jan 2006 02:32:10 +0100] rev 18627
added the lemmas supp_char and supp_string
urbanc [Mon, 09 Jan 2006 15:55:15 +0100] rev 18626
added some lemmas to the collection "abs_fresh"
the lemmas are of the form
finite (supp x) ==> (b # [a].x) = (b=a \/ b # x)
previously only lemmas of the form
(b # [a].x) = (b=a \/ b # x)
with the type-constraint that x is finitely supported
were included.
paulson [Mon, 09 Jan 2006 13:29:08 +0100] rev 18625
_E suffix for compatibility with AddIffs
paulson [Mon, 09 Jan 2006 13:28:34 +0100] rev 18624
tidied
paulson [Mon, 09 Jan 2006 13:28:06 +0100] rev 18623
simplified the special-case simprules
paulson [Mon, 09 Jan 2006 13:27:44 +0100] rev 18622
theorems need names
urbanc [Mon, 09 Jan 2006 00:05:10 +0100] rev 18621
commented the transitivity and narrowing proof
wenzelm [Sat, 07 Jan 2006 23:28:01 +0100] rev 18620
Theory specifications --- with type-inference, but no internal polymorphism.