Sat, 19 Jan 2013 22:18:35 +0100 afford parallel proof terms;
wenzelm [Sat, 19 Jan 2013 22:18:35 +0100] rev 50988
afford parallel proof terms;
Sat, 19 Jan 2013 22:17:26 +0100 always close derivation at the bottom of forked proofs (despite increased non-determinism of proof terms) -- improve parallel performance by avoiding dynamic dependency within large Isar proofs, e.g. Slicing/JinjaVM/SemanticsWF.thy in AFP/bf9b14cbc707;
wenzelm [Sat, 19 Jan 2013 22:17:26 +0100] rev 50987
always close derivation at the bottom of forked proofs (despite increased non-determinism of proof terms) -- improve parallel performance by avoiding dynamic dependency within large Isar proofs, e.g. Slicing/JinjaVM/SemanticsWF.thy in AFP/bf9b14cbc707;
Sat, 19 Jan 2013 21:05:05 +0100 simplified proofs
nipkow [Sat, 19 Jan 2013 21:05:05 +0100] rev 50986
simplified proofs
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -3 +3 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip