Décomposition de l'application n-aire en application binaire pour que Pattern réussisse sur des motifs partiellement appliqués

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@2560 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 6 insertions, 2 deletions

diff --git a/pretyping/termops.ml b/pretyping/termops.ml
index 11afda96b..fec2a9254 100644
--- a/pretyping/termops.ml
+++ b/pretyping/termops.ml
@@ -215,8 +215,12 @@ let map_constr_with_binders_left_to_right g f l c = match kind_of_term c with
       let t' = f l t in
       let c' = f (g (na,Some b,t) l) c in
       mkLetIn (na, b', t', c')
-  | App (c,al) -> 
-      let c' = f l c in mkApp (c', array_map_left (f l) al)
+  | App (c,[||]) -> assert false
+  | App (c,al) ->
+      (*Special treatment to be able to recognize partially applied subterms*)
+      let a = al.(Array.length al - 1) in
+      let hd = f l (mkApp (c, Array.sub al 0 (Array.length al - 1))) in
+      mkApp (hd, [| f l a |])
   | Evar (e,al) -> mkEvar (e, array_map_left (f l) al)
   | Case (ci,p,c,bl) ->
       let p' = f l p in let c' = f l c in