Tue, 19 Dec 2000 15:20:23 +0100 re-orienting equations with 0, 1, 2 on the lhs
paulson [Tue, 19 Dec 2000 15:20:23 +0100] rev 10706
re-orienting equations with 0, 1, 2 on the lhs
Tue, 19 Dec 2000 15:19:12 +0100 new file extract_common_term.ML for the cancel-factor simprocs
paulson [Tue, 19 Dec 2000 15:19:12 +0100] rev 10705
new file extract_common_term.ML for the cancel-factor simprocs
Tue, 19 Dec 2000 15:17:53 +0100 inserting the simproc nat_cancel_factor
paulson [Tue, 19 Dec 2000 15:17:53 +0100] rev 10704
inserting the simproc nat_cancel_factor
Tue, 19 Dec 2000 15:17:21 +0100 inserting the simproc int_cancel_factor
paulson [Tue, 19 Dec 2000 15:17:21 +0100] rev 10703
inserting the simproc int_cancel_factor
Tue, 19 Dec 2000 15:16:21 +0100 new simprule zero_less_abs_iff
paulson [Tue, 19 Dec 2000 15:16:21 +0100] rev 10702
new simprule zero_less_abs_iff
Tue, 19 Dec 2000 15:15:43 +0100 coping with the re-orientation of #nn=x
paulson [Tue, 19 Dec 2000 15:15:43 +0100] rev 10701
coping with the re-orientation of #nn=x
Tue, 19 Dec 2000 15:14:36 +0100 cancel-factor simproc allows shorter proofs
paulson [Tue, 19 Dec 2000 15:14:36 +0100] rev 10700
cancel-factor simproc allows shorter proofs
Tue, 19 Dec 2000 15:06:59 +0100 more tidying
paulson [Tue, 19 Dec 2000 15:06:59 +0100] rev 10699
more tidying
Tue, 19 Dec 2000 15:06:14 +0100 cancel-factor simproc allows a shorter proof
paulson [Tue, 19 Dec 2000 15:06:14 +0100] rev 10698
cancel-factor simproc allows a shorter proof
Tue, 19 Dec 2000 13:06:49 +0100 improved errors;
wenzelm [Tue, 19 Dec 2000 13:06:49 +0100] rev 10697
improved errors;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip