| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
For now, a few vernacular features were lot in the process, like locating
Ltac definitions. This will be fixed in an upcoming commit.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
proof for coqwc
|
|
|
|
3e70ea9c.
|
|
|
|
?INTERNAL#42 style is ugly
|
|
|
|
See also GeoCoq/GeoCoq#7.
|
|
an OCaml "when" clause to the r.h.s of the matching clause
|
|
|
|
|
|
|
|
|
|
|
|
empty queues.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Unused since dc57718e98289b5d71a0a942d6a063d441dc6a54 as far as I can
tell.
|
|
|
|
|
|
|
|
|
|
|
|
See the discussion in the bug tracker, basically the STM delays the
feedback error message to a point where CoqIDE has forgotten about the
sentence, thus we were processing such errors in the generic case,
printing them twice as the Fail case will also do it.
We could indeed revert back to the 8.6 strategy for error (print
always from Fail and ignore Feedback), however I feel that time will
be better spent by fixing the STM than adding more CoqIDE workarounds.
|
|
We don't gain anything from the kernel yet as transparent constants
_do_ require the `side_eff` exporting machinery.
Next step, understand why.
|
|
|
|
|
|
|
|
The old algorithm was relying on list membership, which is O(n). This was
nefarious for terms with many binders. We use instead sets in O(log n).
|
|
|
|
|