diff options
| author | herbelin | 2011-12-16 15:09:07 +0000 |
|---|---|---|
| committer | herbelin | 2011-12-16 15:09:07 +0000 |
| commit | 6c21af13a66a8fd829979476205e32df9e8c0f49 (patch) | |
| tree | 9f3634f39cbeeefff29877db39a353b63c598bc5 /proofs | |
| parent | ec60cad947dc4267f0545626b4ec7145f19f3ee3 (diff) | |
Introducing a notion of evar candidates to be used when an evar is
known in advance to be instantiable by only a finite number of terms.
When an evar with candidates remain unsolved after unification, the
first candidate is taken as a heuristic.
This is used in particular to reduce the number of pending conversion
problems when trying to infer the return clause of a pattern-matching
problem. As an example, this repairs test 2615.v.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14797 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'proofs')
| -rw-r--r-- | proofs/goal.ml | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/proofs/goal.ml b/proofs/goal.ml index b50177eeae..1542267e36 100644 --- a/proofs/goal.ml +++ b/proofs/goal.ml @@ -500,6 +500,7 @@ module V82 = struct (Environ.named_context_of_val hyps); Evd.evar_body = Evd.Evar_empty; Evd.evar_source = (Util.dummy_loc,Evd.GoalEvar); + Evd.evar_candidates = None; Evd.evar_extra = extra } in let evi = Typeclasses.mark_unresolvable evi in |