| Commit message (Collapse) | Author | Age |
|
|
|
|
|
|
|
|
|
|
|
|
| |
corresponding Declare ML Module command. This changes essentially two
things:
1. ML plugins are forced to use the DECLARE PLUGIN statement before any
TACTIC EXTEND statement. The plugin name must be exactly the string passed to
the Declare ML Module command.
2. ML tactics are only made available after the Coq module that does the
corresponding Declare ML Module is imported. This may break a few things,
as it already broke quite some uses of omega in the stdlib.
|
| |
|
|
|
|
| |
dynamic. This is done with the "DECLARE PLUGIN \"name\"" macro.
|
|
|
|
|
| |
caching time, i.e. when the Declare ML Module command is evaluated. This can
be used by both static and dynamic plugins.
|
| |
|
|
|
|
| |
and the lookup operation proved to be costly when dealing with big libraries.
|
|
|
|
| |
instead of lists to test if a library has already been encountered.
|
|
|
|
|
|
|
|
| |
The contract is that a file in bugs/opened should not raise errors if
the bug is still open.
Some of them fail for different reasons than they used to; I'm not sure
what to do about these.
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
hese regression tests are aggregated from the various bugs I (and
others) have reported on https://github.com/HoTT/coq/issues relating to
universe polymorphism, primitive projections, and eta for records.
These are the tests that trunk currently fails.
I'm not sure about the naming scheme (HoTT_coq_###.v, where ### is the
number of the issue in GitHub), but I couldn't think of a better one.
|
| |
|
| |
|
| |
|
|
|
|
| |
fixing two opened bugs from HoTT/coq.
|
|\
| |
| |
| | |
into JasonGross-working-polyproj-tests
|
| |
| |
| |
| |
| | |
abstraction has the right type. Fixes bug# 3306.
Add test-suite files for bugs 3305 and 3306.
|
| | |
|
| |
| |
| |
| | |
problem with hashconsing at the same time. This fixes bug# 3302.
|
| |
| |
| |
| | |
tactics.
|
| |
| |
| |
| |
| |
| |
| | |
(made push command with wrong local ref; leaving control to Matthieu
on new revert)
This reverts commit b797ba85b7b0f82d66af5629ccf6f75d90dda99a.
|
| | |
|
| | |
|
| |
| |
| |
| | |
which compute an abstraction of the goal over a term or a pattern.
|
| |
| |
| |
| |
| | |
works in the presence of local definitions referring to x and
dependent in other hyps or concl.
|
| | |
|
| |
| |
| |
| | |
Also removing trailing spaces.
|
| | |
|
| |
| |
| |
| |
| |
| |
| | |
#3302) by considering
Type i a ground term even when "i" is a flexible universe variable, using the infer_conv
function to do the unification of universes.
|
| |
| |
| |
| |
| |
| |
| |
| | |
evar_map
in tactics, avoiding useless and potentially costly merge's of constraints.
- Implement revert and generalize using the new tactics (not bound to syntax though,
as they are not backwards-compatible yet).
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
| |
| |
| | |
shows the polymorphism status of the term.
|
| | |
|
| |
| |
| |
| | |
answers #3299).
|
| | |
|
|/
|
|
|
|
|
|
|
|
| |
These regression tests are aggregated from the various bugs I (and
others) have reported on https://github.com/HoTT/coq/issues relating to
universe polymorphism, primitive projections, and eta for records.
These are the tests that trunk currently passes.
I'm not sure about the naming scheme (HoTT_coq_###.v, where ### is the
number of the issue in GitHub), but I couldn't think of a better one.
|
| |
|
| |
|
|
|
|
|
|
| |
V82.tactic (tclEVARS _).
Again, performance is back to normal. Remove reintroduced try .. with _ -> in raw_enter's.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
| |
in the Evd of proofs (Evd.from_env).
- Allow to set the Store.t value of new evars, e.g. to set constraint evars as
unresolvable in rewrite.ml.
- Fix a HUGE performance problem in the processing of constraints, which was remerging
all the previous constraints with the ambient global universes at each new constraint addition.
Performance is now back to (or better than) normal.
|
|
|
|
|
| |
Fix restriction of universe contexts to not forget about potentially useful
constraints.
|
|
|
|
| |
universe polymorphic constructors.
|
|
|
|
|
|
|
| |
eagerly solve l <= k constraints as k := l when k is a fresh variable coming
from a template type. This has the effect of fixing the variable at the first
instantiation of the parameters of template polymorphic inductive and avoiding
to generate useless <= constraints that need to be minimized afterwards.
|
| |
|