Mon, 24 May 1999 21:54:34 +0200 write_keywords generates outer syntax keyword classification in elisp;
wenzelm [Mon, 24 May 1999 21:54:34 +0200] rev 6720
write_keywords generates outer syntax keyword classification in elisp;
Mon, 24 May 1999 21:53:18 +0200 outer syntax keyword classification;
wenzelm [Mon, 24 May 1999 21:53:18 +0200] rev 6719
outer syntax keyword classification; no open OuterParse;
Mon, 24 May 1999 15:56:24 +0200 renamed Lprg to Lift; simplified proof of Always_nonneg
paulson [Mon, 24 May 1999 15:56:24 +0200] rev 6718
renamed Lprg to Lift; simplified proof of Always_nonneg
Mon, 24 May 1999 15:54:58 +0200 int_Suc->int_Suc_int_1 avoiding confusion with the more useful Bin.int_Suc
paulson [Mon, 24 May 1999 15:54:58 +0200] rev 6717
int_Suc->int_Suc_int_1 avoiding confusion with the more useful Bin.int_Suc
Mon, 24 May 1999 15:54:12 +0200 Better simplification of (nat #0), (int (Suc 0)), etc
paulson [Mon, 24 May 1999 15:54:12 +0200] rev 6716
Better simplification of (nat #0), (int (Suc 0)), etc
Mon, 24 May 1999 15:53:28 +0200 UN_singleton->UN_constant_eq removes clash with other UN_singleton
paulson [Mon, 24 May 1999 15:53:28 +0200] rev 6715
UN_singleton->UN_constant_eq removes clash with other UN_singleton
Mon, 24 May 1999 15:51:33 +0200 new rule single_leadsTo_I; stronger PSP rule
paulson [Mon, 24 May 1999 15:51:33 +0200] rev 6714
new rule single_leadsTo_I; stronger PSP rule
Mon, 24 May 1999 15:50:53 +0200 increasing makes sense only for partial orderings
paulson [Mon, 24 May 1999 15:50:53 +0200] rev 6713
increasing makes sense only for partial orderings
Mon, 24 May 1999 15:50:23 +0200 generalized increasing_size to mono_increasing_o
paulson [Mon, 24 May 1999 15:50:23 +0200] rev 6712
generalized increasing_size to mono_increasing_o
Mon, 24 May 1999 15:49:44 +0200 updated for stronger version of psp
paulson [Mon, 24 May 1999 15:49:44 +0200] rev 6711
updated for stronger version of psp
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip