forked from coq/coq
-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
…ound de Bruijn indices when unifying holes under a "fun" Reviewed-by: ppedrot Co-authored-by: ppedrot <[email protected]>
- Loading branch information
Showing
3 changed files
with
21 additions
and
1 deletion.
There are no files selected for viewing
7 changes: 7 additions & 0 deletions
7
...changelog/04-tactics/19769-master+fix17314-wrong-env-unif-meta-under-lambda.rst
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,7 @@ | ||
- **Fixed:** | ||
Unbound variables were sometimes generated when a metavariable of a | ||
theorem given to :tacn:`apply` occurred in the type of the theorem | ||
under a :n:`fun` | ||
(`#19769 <https://github.com/coq/coq/pull/19769>`_, | ||
fixes `#17314 <https://github.com/coq/coq/issues/17314>`_, | ||
by Hugo Herbelin). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,13 @@ | ||
Definition arrow_apply (f : Prop -> Prop) := True -> f True. (* We need True-> to trigger a unification in an extended context *) | ||
|
||
Definition something (x : Prop) := arrow_apply (fun _ => x). | ||
|
||
Axiom trivial: forall l1: Prop, something l1 -> something l1. | ||
|
||
Lemma t : exists f, arrow_apply f. | ||
eexists. | ||
unshelve apply trivial. | ||
(* was giving "something ?l1@{t:=_UNBOUND_REL_1}" while the evar is not supposed to depend on t *) | ||
(* so, we check that, indeed, t is not here *) | ||
match goal with [ H : True |- _ ] => fail 1 | _ => idtac end. | ||
Abort. |