| Commit message (Collapse) | Author | Age |
|
|
|
|
| |
As a bonus we remove some trailing whitespace, and implement a couple
of hints suggested in the discussion.
|
|
|
|
| |
4.02.3 has been the minimal OCaml version for a while now.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
Generalize the old model by letting one park a worker and
by letting the (parked) worker be picky about the tasks it
picks up.
The use of that is the following: a proof worker, while performing
its "main" task (building a proof term) computes all the intermediate
states but returns only its main result. One can ask the worker
to hang around, and react to special tasks, like printing the
goals of an intermediate state.
|
|
|
|
|
| |
This is mainly shuffling code around and removing internal
refs that are not needed anymore.
|
| |
|
|
|
|
|
| |
par: distributes the goals among a number of workers given
by -async-proofs-tac-j (defaults to 2).
|
|
|