clasohm [Sun, 17 Oct 1993 17:23:51 +0100] rev 8
renamed utermlemmas.* to utlemmas.*
wenzelm [Fri, 08 Oct 1993 13:46:13 +0100] rev 7
removed THE;
lcp [Thu, 07 Oct 1993 10:29:23 +0100] rev 6
used ~= for "not equals" and ~: for "not in"
lcp [Thu, 07 Oct 1993 10:20:30 +0100] rev 5
added ~= for "not equals" and added ~: for "not in"
wenzelm [Mon, 04 Oct 1993 15:43:54 +0100] rev 4
HOL/hol.thy
renamed mk_alt_ast_tr' to alt_ast_tr';
added alternative quantifier THE;
replaced Ast by Syntax;
HOL/set.thy
replaced HOL.mk_alt_ast_tr' by HOL.alt_ast_tr';
lcp [Tue, 28 Sep 1993 14:27:31 +0100] rev 3
This repeats a previous commit, which failed to update simpdata.ML because
a lock file was present.
lcp [Wed, 22 Sep 1993 15:43:05 +0200] rev 2
Added weak congruence rules to HOL: if_weak_cong, case_weak_cong,
split_weak_cong, nat_case_weak_cong, nat_rec_weak_cong. Used in llist.ML
to make simplifications faster.
HOL/gfp: re-ordered premises to put mono(f) early (first or right after
A==gfp(f) in the def_ rules). Renamed some variables in rules, A to X and
h to A. Renamed coinduct to weak_coinduct, coinduct2 to coinduct.
Strengthened coinduct as suggested by j. Frost, to have the premise X <= f(X
Un gfp(f)).
HOL/llist: used stronger coinduct rule to strengthen LList_coinduct,
LList_equalityI, llist_equalityI, llist_fun_equalityI and to delete the "2"
form of those rules. Proved List_Fun_LList_I, LListD_Fun_diag_I and
llistD_Fun_range_I to help use the new coinduction rules; most proofs
involving them required small changes. Proved prod_fun_range_eq_diag as
lemma for llist_equalityI.
nipkow [Thu, 16 Sep 1993 14:29:14 +0200] rev 1
defined addcongs locally in simpdata.ML
clasohm [Thu, 16 Sep 1993 12:21:07 +0200] rev 0
Initial revision