paulson [Thu, 01 Oct 2009 16:42:53 +0100] rev 32822
Proved a new theorem: nat_to_nat2_inj
boehmes [Thu, 01 Oct 2009 15:54:55 +0200] rev 32821
turned unsynchronized ref into synchronized var
nipkow [Thu, 01 Oct 2009 15:19:49 +0200] rev 32820
merged
nipkow [Thu, 01 Oct 2009 15:19:23 +0200] rev 32819
resolved conflict
nipkow [Thu, 01 Oct 2009 11:35:13 +0200] rev 32818
record max lemmas used
wenzelm [Thu, 01 Oct 2009 18:24:06 +0200] rev 32817
Lazy evaluation with memoing (sequential version).
wenzelm [Thu, 01 Oct 2009 18:21:11 +0200] rev 32816
more official status of sequential implementations;
tuned;
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;
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;
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;