Tue, 19 Jun 2007 18:00:49 +0200 krauss generalized proofs so that call graphs can have any node type.
Tue, 19 Jun 2007 00:02:16 +0200 wenzelm macbroy5: trying -j 2;
Mon, 18 Jun 2007 23:30:46 +0200 wenzelm tuned conjunction tactics: slightly smaller proof terms;
(0) -10000 -3000 -1000 -300 -100 -30 -10 -3 +3 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip