Thu, 01 Oct 2009 15:19:23 +0200 resolved conflict
nipkow [Thu, 01 Oct 2009 15:19:23 +0200] rev 32819
resolved conflict
Thu, 01 Oct 2009 11:35:13 +0200 record max lemmas used
nipkow [Thu, 01 Oct 2009 11:35:13 +0200] rev 32818
record max lemmas used
Thu, 01 Oct 2009 18:24:06 +0200 Lazy evaluation with memoing (sequential version).
wenzelm [Thu, 01 Oct 2009 18:24:06 +0200] rev 32817
Lazy evaluation with memoing (sequential version).
Thu, 01 Oct 2009 18:21:11 +0200 more official status of sequential implementations;
wenzelm [Thu, 01 Oct 2009 18:21:11 +0200] rev 32816
more official status of sequential implementations; tuned;
Thu, 01 Oct 2009 18:10:41 +0200 separate concurrent/sequential versions of lazy evaluation;
wenzelm [Thu, 01 Oct 2009 18:10:41 +0200] rev 32815
separate concurrent/sequential versions of lazy evaluation; lazy based on future avoids wasted evaluations;
Thu, 01 Oct 2009 16:27:13 +0200 added Task_Queue.depend (again) -- light-weight version for transitive graph;
wenzelm [Thu, 01 Oct 2009 16:27:13 +0200] rev 32814
added Task_Queue.depend (again) -- light-weight version for transitive graph; Future.join_results: record explicit dependency, detect direct task-task join cycles; Future.join_results: no change of interruptibility, allows to interrupt wait; added Future.worker_task; ThyInfo.schedule_futures: uninterruptible outer join;
Thu, 01 Oct 2009 16:09:47 +0200 handle Pattern.MATCH, not arbitrary exceptions;
wenzelm [Thu, 01 Oct 2009 16:09:47 +0200] rev 32813
handle Pattern.MATCH, not arbitrary exceptions; misc tuning, trying to reduce line length a bit;
Thu, 01 Oct 2009 16:03:43 +0200 more precise dependencies;
wenzelm [Thu, 01 Oct 2009 16:03:43 +0200] rev 32812
more precise dependencies;
Thu, 01 Oct 2009 15:44:42 +0200 eliminated redundant parameters;
wenzelm [Thu, 01 Oct 2009 15:44:42 +0200] rev 32811
eliminated redundant parameters;
Thu, 01 Oct 2009 14:27:50 +0200 back to simple fold_body_thms and fulfill_proof/thm_proof (reverting a900d3cd47cc) -- the cycle check is implicit in the future computation of join_proofs;
wenzelm [Thu, 01 Oct 2009 14:27:50 +0200] rev 32810
back to simple fold_body_thms and fulfill_proof/thm_proof (reverting a900d3cd47cc) -- the cycle check is implicit in the future computation of join_proofs;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip