Tue, 18 Sep 2012 03:33:53 +0200 tuned
nipkow [Tue, 18 Sep 2012 03:33:53 +0200] rev 49433
tuned
Tue, 18 Sep 2012 03:24:51 +0200 beautified names
nipkow [Tue, 18 Sep 2012 03:24:51 +0200] rev 49432
beautified names
Tue, 18 Sep 2012 01:55:13 +0200 proved all upper bounds
nipkow [Tue, 18 Sep 2012 01:55:13 +0200] rev 49431
proved all upper bounds
Mon, 17 Sep 2012 21:33:12 +0200 tuned simpset
blanchet [Mon, 17 Sep 2012 21:33:12 +0200] rev 49430
tuned simpset
Mon, 17 Sep 2012 21:13:30 +0200 cleaner way of dealing with the set functions of sums and products
blanchet [Mon, 17 Sep 2012 21:13:30 +0200] rev 49429
cleaner way of dealing with the set functions of sums and products
Mon, 17 Sep 2012 21:13:30 +0200 handle the general case with more than two levels of nesting when discharging induction prem prems
blanchet [Mon, 17 Sep 2012 21:13:30 +0200] rev 49428
handle the general case with more than two levels of nesting when discharging induction prem prems
Mon, 17 Sep 2012 21:13:30 +0200 clean unfolding of prod and sum sets
blanchet [Mon, 17 Sep 2012 21:13:30 +0200] rev 49427
clean unfolding of prod and sum sets
Mon, 17 Sep 2012 21:13:30 +0200 got rid of one "auto" in induction tactic
blanchet [Mon, 17 Sep 2012 21:13:30 +0200] rev 49426
got rid of one "auto" in induction tactic
Mon, 17 Sep 2012 16:57:22 +0200 cleaned up internal naming scheme for bnfs
traytel [Mon, 17 Sep 2012 16:57:22 +0200] rev 49425
cleaned up internal naming scheme for bnfs
Wed, 19 Sep 2012 12:10:40 +0200 more robust GUI component handlers;
wenzelm [Wed, 19 Sep 2012 12:10:40 +0200] rev 49424
more robust GUI component handlers;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip