aboutsummaryrefslogtreecommitdiffhomepage
path: root/pretyping/typing.mli
diff options
context:
space:
mode:
authorGravatar herbelin <herbelin@85f007b7-540e-0410-9357-904b9bb8a0f7>2011-10-10 22:00:22 +0000
committerGravatar herbelin <herbelin@85f007b7-540e-0410-9357-904b9bb8a0f7>2011-10-10 22:00:22 +0000
commit698c79dc28a13baf864c863800a2b48690207e34 (patch)
treebe1e74ff347d09ef9fabee5ab2d6efa36caedcf2 /pretyping/typing.mli
parent604b9cdff3b5bae0be66b4ab93cf06a21a59a496 (diff)
Applied the trick of Chung-Kil Hur to solve second-order matching
problems with dependencies. Generalized it to matching over dependent tuples as explored by Dan Grayson. Currently used only in Evarconv. git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14538 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'pretyping/typing.mli')
-rw-r--r--pretyping/typing.mli2
1 files changed, 1 insertions, 1 deletions
diff --git a/pretyping/typing.mli b/pretyping/typing.mli
index e2fd6a9d8..2c9a6c6c0 100644
--- a/pretyping/typing.mli
+++ b/pretyping/typing.mli
@@ -27,7 +27,7 @@ val check : env -> evar_map -> constr -> types -> unit
val meta_type : evar_map -> metavariable -> types
(** Solve existential variables using typing *)
-val solve_evars : env -> evar_map -> constr -> constr
+val solve_evars : env -> evar_map -> constr -> evar_map * constr
(** Raise an error message if incorrect elimination for this inductive *)
(** (first constr is term to match, second is return predicate) *)