Thu, 02 Oct 2008 12:17:20 +0200 |
berghofe |
Yet another proof of Newman's lemma, this time using the coherent logic prover.
|
changeset |
files
|
Wed, 01 Oct 2008 22:33:29 +0200 |
wenzelm |
unit_source: more rigid parsing, stop after final qed;
|
changeset |
files
|
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;
|
changeset |
files
|
Wed, 01 Oct 2008 22:33:24 +0200 |
wenzelm |
replaced can_defer by is_relevant (negation);
|
changeset |
files
|
Wed, 01 Oct 2008 20:02:37 +0200 |
wenzelm |
datatype transition: internal trans field is maintained in reverse order;
|
changeset |
files
|
Wed, 01 Oct 2008 18:16:14 +0200 |
wenzelm |
future_proof: protect conclusion of deferred proof state;
|
changeset |
files
|
Wed, 01 Oct 2008 18:16:10 +0200 |
wenzelm |
future_schedule: back to one group for all loader tasks;
|
changeset |
files
|
Wed, 01 Oct 2008 14:17:06 +0200 |
wenzelm |
tuned comments;
|
changeset |
files
|
Wed, 01 Oct 2008 13:33:54 +0200 |
haftmann |
fixed
|
changeset |
files
|
Wed, 01 Oct 2008 12:18:18 +0200 |
wenzelm |
renamed promise to future, tuned related interfaces;
|
changeset |
files
|
Wed, 01 Oct 2008 12:00:05 +0200 |
wenzelm |
more robust treatment of Interrupt (cf. exn.ML);
|
changeset |
files
|
Wed, 01 Oct 2008 12:00:04 +0200 |
wenzelm |
more robust treatment of Interrupt;
|
changeset |
files
|