Fri, 12 May 2006 04:20:02 +0200 add new finite chain theorems
huffman [Fri, 12 May 2006 04:20:02 +0200] rev 19621
add new finite chain theorems
Fri, 12 May 2006 01:01:08 +0200 improved propagate_deps;
wenzelm [Fri, 12 May 2006 01:01:08 +0200] rev 19620
improved propagate_deps; removed structs_less, which is actually unsound in conjunction with interdependent overloaded consts;
Thu, 11 May 2006 21:46:17 +0200 check result against certified prop, i.e. admit non-normal statements;
wenzelm [Thu, 11 May 2006 21:46:17 +0200] rev 19619
check result against certified prop, i.e. admit non-normal statements;
Thu, 11 May 2006 19:19:33 +0200 tuned;
wenzelm [Thu, 11 May 2006 19:19:33 +0200] rev 19618
tuned;
Thu, 11 May 2006 19:19:31 +0200 avoid raw equality on type thm;
wenzelm [Thu, 11 May 2006 19:19:31 +0200] rev 19617
avoid raw equality on type thm;
Thu, 11 May 2006 19:15:16 +0200 replaced Graph.fold_nodes by general Graph.fold;
wenzelm [Thu, 11 May 2006 19:15:16 +0200] rev 19616
replaced Graph.fold_nodes by general Graph.fold;
Thu, 11 May 2006 19:15:15 +0200 added fold;
wenzelm [Thu, 11 May 2006 19:15:15 +0200] rev 19615
added fold; removed fold_nodes; added IntGraph; tuned;
Thu, 11 May 2006 19:15:14 +0200 tuned Defs.merge;
wenzelm [Thu, 11 May 2006 19:15:14 +0200] rev 19614
tuned Defs.merge;
Thu, 11 May 2006 19:15:13 +0200 allow dependencies of disjoint collections of instances;
wenzelm [Thu, 11 May 2006 19:15:13 +0200] rev 19613
allow dependencies of disjoint collections of instances; major cleanup;
Thu, 11 May 2006 19:15:12 +0200 use IntGraph from Pure;
wenzelm [Thu, 11 May 2006 19:15:12 +0200] rev 19612
use IntGraph from Pure;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip