From 698c79dc28a13baf864c863800a2b48690207e34 Mon Sep 17 00:00:00 2001 From: herbelin Date: Mon, 10 Oct 2011 22:00:22 +0000 Subject: 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 --- pretyping/typing.mli | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'pretyping/typing.mli') 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) *) -- cgit v1.2.3