lcp [Mon, 20 Sep 1993 18:39:45 +0200] rev 9
make-all now has set +e so that New Jersey runs will continue even if some
logic fails. change_simp added to help change to new simplifier.
lcp [Mon, 20 Sep 1993 17:02:11 +0200] rev 8
Installation of new simplfier. Previously appeared to set up the old
simplifier to rewrite with the partial ordering [=, something not possible
with the new simplifier. But such rewriting appears not to have actually
been used, and there were few complications. In terms.ML setloop was used
to avoid infinite rewriting with the letrec rule. Congruence rules were
deleted, and an occasional SIMP_TAC had to become asm_simp_tac.
lcp [Fri, 17 Sep 1993 16:52:10 +0200] rev 7
Installation of new simplifier for ZF/ex. The hom_ss example in misc.ML is
particularly delicate. There is a variable renaming problem in
ramsey.ML/pigeon2_lemma. In some cases, rewriting by typechecking rules
had to be replaced by setsolver type_auto_tac... because only the solver
can instantiate variables.
lcp [Fri, 17 Sep 1993 16:16:38 +0200] rev 6
Installation of new simplifier for ZF. Deleted all congruence rules not
involving local assumptions. NB the congruence rules for Sigma and Pi
(dependent type constructions) cause difficulties and are not used by
default.
lcp [Fri, 17 Sep 1993 12:53:53 +0200] rev 5
test commit
nipkow [Thu, 16 Sep 1993 17:41:10 +0200] rev 4
added header
nipkow [Thu, 16 Sep 1993 16:55:17 +0200] rev 3
defined local addcongs