Thu, 02 Oct 2008 12:17:20 +0200 berghofe Yet another proof of Newman's lemma, this time using the coherent logic prover.
Wed, 01 Oct 2008 22:33:29 +0200 wenzelm unit_source: more rigid parsing, stop after final qed;
Wed, 01 Oct 2008 22:33:28 +0200 wenzelm excursion/unit_result: no print for forked end, finish into global theory, pick resul from presentation context;
Wed, 01 Oct 2008 22:33:24 +0200 wenzelm replaced can_defer by is_relevant (negation);
Wed, 01 Oct 2008 20:02:37 +0200 wenzelm datatype transition: internal trans field is maintained in reverse order;
Wed, 01 Oct 2008 18:16:14 +0200 wenzelm future_proof: protect conclusion of deferred proof state;
Wed, 01 Oct 2008 18:16:10 +0200 wenzelm future_schedule: back to one group for all loader tasks;
Wed, 01 Oct 2008 14:17:06 +0200 wenzelm tuned comments;
Wed, 01 Oct 2008 13:33:54 +0200 haftmann fixed
Wed, 01 Oct 2008 12:18:18 +0200 wenzelm renamed promise to future, tuned related interfaces;
Wed, 01 Oct 2008 12:00:05 +0200 wenzelm more robust treatment of Interrupt (cf. exn.ML);
Wed, 01 Oct 2008 12:00:04 +0200 wenzelm more robust treatment of Interrupt;
(0) -10000 -3000 -1000 -300 -100 -12 +12 +100 +300 +1000 +3000 +10000 +30000 tip