| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | par: like all: but in parallel |  Enrico Tassi | 2016-06-17 |
| | | | | | | | | | | | | | | This commit documents par:, fixes its semantics so that is behaves like all:, supports (toplevel) abstract and optimizes toplevel solve. `par: solve [tac]` is equivalent to `Ltac tac1 := solve[tac]...par: tac1` but is optimized for failures: if one goal fails all are aborted immediately. `par: abstract tac` runs abstract on the generated proof terms. Nested abstract calls are not supported. | ||
| * | STM: new "par:" goal selector, like "all:" but in parallel | Enrico Tassi | 2014-08-05 |
| par: distributes the goals among a number of workers given by -async-proofs-tac-j (defaults to 2). | |||
 |
index : coq | |
| the Coq proof assistant |
| aboutsummaryrefslogtreecommitdiffhomepage |