From 8cadbeff68559ee4a621f9ac3ed44c5e5da7a8ba Mon Sep 17 00:00:00 2001
From: msozeau
Date: Sat, 28 Mar 2009 21:31:54 +0000
Subject: Rewrite of Program Fixpoint to overcome the previous limitations: -
 The measure can now refer to all the formal arguments - The recursive calls
 can make all the arguments vary as well - Generalized to any relation and
 measure (new syntax {measure m on R}) This relies on an automatic
 curryfication transformation, the real fixpoint combinator is working on a
 sigma type of the arguments. Reduces to the previous impl in case only one
 argument is involved. The patch also introduces a new flag on implicit
 arguments that says if the argument has to be infered (default) or can be
 turned into a subgoal/obligation. Comes with a test-suite file.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12030 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 plugins/interface/depends.ml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'plugins/interface')

diff --git a/plugins/interface/depends.ml b/plugins/interface/depends.ml
index e59de34a48..378f9972ea 100644
--- a/plugins/interface/depends.ml
+++ b/plugins/interface/depends.ml
@@ -88,7 +88,7 @@ let trd_of_3 (_, _, x) = x
    prooftree will also depend on things like tactic declarations, etc
    so we may need a new type for that. *)
 let rec depends_of_hole_kind hk acc = match hk with
-  | Evd.ImplicitArg (gr,_)            -> gr::acc
+  | Evd.ImplicitArg (gr,_,_)            -> gr::acc
   | Evd.TomatchTypeParameter (ind, _) -> (IndRef ind)::acc
   | Evd.BinderType _
   | Evd.QuestionMark _
-- 
cgit v1.2.3