X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Ftactics%2FproofEngineHelpers.ml;h=4adcb84167f350d52fab42011fa16d70d361fa74;hb=80fc89019bcb7fb7e0e1fb8bb111b708be49d19f;hp=aec43abc373750a42f8edbe26c807950e68d516b;hpb=7b922ad1f9832c1edb3acea8f0c910fa2c0c20e5;p=helm.git

diff --git a/helm/ocaml/tactics/proofEngineHelpers.ml b/helm/ocaml/tactics/proofEngineHelpers.ml
index aec43abc3..4adcb8416 100644
--- a/helm/ocaml/tactics/proofEngineHelpers.ml
+++ b/helm/ocaml/tactics/proofEngineHelpers.ml
@@ -23,12 +23,19 @@
  * http://cs.unibo.it/helm/.
  *)
 
+exception Bad_pattern of string
+
 let new_meta_of_proof ~proof:(_, metasenv, _, _) =
-  CicMkImplicit.new_meta metasenv
+  CicMkImplicit.new_meta metasenv []
 
 let subst_meta_in_proof proof meta term newmetasenv =
  let uri,metasenv,bo,ty = proof in
-  let subst_in = CicMetaSubst.apply_subst [meta,term] in
+   (* empty context is ok for term since it wont be used by apply_subst *)
+   (* hack: since we do not know the context and the type of term, we
+      create a substitution with cc =[] and type = Implicit; they will be
+      in  any case dropped by apply_subst, but it would be better to rewrite
+      the code. Cannot we just use apply_subst_metasenv, etc. ?? *)
+  let subst_in = CicMetaSubst.apply_subst [meta,([], term,Cic.Implicit None)] in
    let metasenv' =
     newmetasenv @ (List.filter (function (m,_,_) -> m <> meta) metasenv)
    in
@@ -48,7 +55,11 @@ let subst_meta_in_proof proof meta term newmetasenv =
       ) metasenv'
     in
      let bo' = subst_in bo in
-      let newproof = uri,metasenv'',bo',ty in
+     (* Metavariables can appear also in the *statement* of the theorem
+      * since the parser does not reject as statements terms with
+      * metavariable therein *)
+     let ty' = subst_in ty in
+      let newproof = uri,metasenv'',bo',ty' in
        (newproof, metasenv'')
 
 (*CSC: commento vecchio *)
@@ -66,6 +77,10 @@ let subst_meta_in_proof proof meta term newmetasenv =
 let subst_meta_and_metasenv_in_proof proof meta subst_in newmetasenv =
  let (uri,_,bo,ty) = proof in
   let bo' = subst_in bo in
+  (* Metavariables can appear also in the *statement* of the theorem
+   * since the parser does not reject as statements terms with
+   * metavariable therein *)
+  let ty' = subst_in ty in
   let metasenv' =
    List.fold_right
     (fun metasenv_entry i ->
@@ -85,6 +100,195 @@ let subst_meta_and_metasenv_in_proof proof meta subst_in newmetasenv =
        | _ -> i
     ) newmetasenv []
   in
-   let newproof = uri,metasenv',bo',ty in
+   let newproof = uri,metasenv',bo',ty' in
     (newproof, metasenv')
 
+let compare_metasenvs ~oldmetasenv ~newmetasenv =
+ List.map (function (i,_,_) -> i)
+  (List.filter
+   (function (i,_,_) ->
+     not (List.exists (fun (j,_,_) -> i=j) oldmetasenv)) newmetasenv)
+;;
+
+(** finds the _pointers_ to subterms that are alpha-equivalent to wanted in t *)
+let find_subterms ~wanted ~context t =
+  let rec find context w t =
+    if ProofEngineReduction.alpha_equivalence w t then 
+      [context,t]
+    else
+      match t with
+      | Cic.Sort _ 
+      | Cic.Rel _ -> []
+      | Cic.Meta (_, ctx) -> 
+          List.fold_left (
+            fun acc e -> 
+              match e with 
+              | None -> acc 
+              | Some t -> find context w t @ acc
+          ) [] ctx
+      | Cic.Lambda (name, t1, t2) 
+      | Cic.Prod (name, t1, t2) ->
+          find context w t1 @
+          find (Some (name, Cic.Decl t1)::context)
+           (CicSubstitution.lift 1 w) t2
+      | Cic.LetIn (name, t1, t2) -> 
+          find context w t1 @
+          find (Some (name, Cic.Def (t1,None))::context)
+           (CicSubstitution.lift 1 w) t2
+      | Cic.Appl l -> 
+          List.fold_left (fun acc t -> find context w t @ acc) [] l
+      | Cic.Cast (t, ty) -> find context w t @ find context w ty
+      | Cic.Implicit _ -> assert false
+      | Cic.Const (_, esubst)
+      | Cic.Var (_, esubst) 
+      | Cic.MutInd (_, _, esubst) 
+      | Cic.MutConstruct (_, _, _, esubst) -> 
+          List.fold_left (fun acc (_, t) -> find context w t @ acc) [] esubst
+      | Cic.MutCase (_, _, outty, indterm, patterns) -> 
+          find context w outty @ find context w indterm @ 
+            List.fold_left (fun acc p -> find context w p @ acc) [] patterns
+      | Cic.Fix (_, funl) -> 
+         let tys =
+          List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) funl
+         in
+          List.fold_left (
+            fun acc (_, _, ty, bo) ->
+             find context w ty @ find (tys @ context) w bo @ acc
+          ) [] funl
+      | Cic.CoFix (_, funl) ->
+         let tys =
+          List.map (fun (n,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) funl
+         in
+          List.fold_left (
+            fun acc (_, ty, bo) ->
+             find context w ty @ find (tys @ context) w bo @ acc
+          ) [] funl
+  in
+  find context wanted t
+  
+let select ~context ~term ~pattern:(wanted,where) =
+  let add_ctx context name entry =
+      (Some (name, entry)) :: context
+  in
+  let rec aux context where term =
+    match (where, term) with
+    | Cic.Implicit (Some `Hole), t -> [context,t]
+    | Cic.Implicit (Some `Type), t -> []
+    | Cic.Implicit None,_ -> []
+    | Cic.Meta (_, ctxt1), Cic.Meta (_, ctxt2) ->
+        List.concat
+          (List.map2
+            (fun t1 t2 ->
+              (match (t1, t2) with
+                  Some t1, Some t2 -> aux context t1 t2
+                | _ -> []))
+            ctxt1 ctxt2)
+    | Cic.Cast (te1, ty1), Cic.Cast (te2, ty2) ->
+       aux context te1 te2 @ aux context ty1 ty2
+    | Cic.Prod (Cic.Anonymous, s1, t1), Cic.Prod (name, s2, t2)
+    | Cic.Lambda (Cic.Anonymous, s1, t1), Cic.Lambda (name, s2, t2) ->
+        aux context s1 s2 @ aux (add_ctx context name (Cic.Decl s2)) t1 t2
+    | Cic.Prod (Cic.Name n1, s1, t1), 
+      Cic.Prod ((Cic.Name n2) as name , s2, t2)
+    | Cic.Lambda (Cic.Name n1, s1, t1), 
+      Cic.Lambda ((Cic.Name n2) as name, s2, t2) when n1 = n2->
+        aux context s1 s2 @ aux (add_ctx context name (Cic.Decl s2)) t1 t2
+    | Cic.Prod (name1, s1, t1), Cic.Prod (name2, s2, t2)
+    | Cic.Lambda (name1, s1, t1), Cic.Lambda (name2, s2, t2) -> []
+    | Cic.LetIn (Cic.Anonymous, s1, t1), Cic.LetIn (name, s2, t2) -> 
+        aux context s1 s2 @ aux (add_ctx context name (Cic.Def (s2,None))) t1 t2
+    | Cic.LetIn (Cic.Name n1, s1, t1), 
+      Cic.LetIn ((Cic.Name n2) as name, s2, t2) when n1 = n2-> 
+        aux context s1 s2 @ aux (add_ctx context name (Cic.Def (s2,None))) t1 t2
+    | Cic.LetIn (name1, s1, t1), Cic.LetIn (name2, s2, t2) -> []
+    | Cic.Appl terms1, Cic.Appl terms2 -> auxs context terms1 terms2
+    | Cic.Var (_, subst1), Cic.Var (_, subst2)
+    | Cic.Const (_, subst1), Cic.Const (_, subst2)
+    | Cic.MutInd (_, _, subst1), Cic.MutInd (_, _, subst2)
+    | Cic.MutConstruct (_, _, _, subst1), Cic.MutConstruct (_, _, _, subst2) ->
+        auxs context (List.map snd subst1) (List.map snd subst2)
+    | Cic.MutCase (_, _, out1, t1, pat1), Cic.MutCase (_ , _, out2, t2, pat2) ->
+        aux context out1 out2 @ aux context t1 t2 @ auxs context pat1 pat2
+    | Cic.Fix (_, funs1), Cic.Fix (_, funs2) ->
+       let tys =
+        List.map (fun (n,_,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) funs2
+       in
+        List.concat
+          (List.map2
+            (fun (_, _, ty1, bo1) (_, _, ty2, bo2) -> 
+              aux context ty1 ty2 @ aux (tys @ context) bo1 bo2)
+            funs1 funs2)
+    | Cic.CoFix (_, funs1), Cic.CoFix (_, funs2) ->
+       let tys =
+        List.map (fun (n,ty,_) -> Some (Cic.Name n,(Cic.Decl ty))) funs2
+       in
+        List.concat
+          (List.map2
+            (fun (_, ty1, bo1) (_, ty2, bo2) ->
+              aux context ty1 ty2 @ aux (tys @ context) bo1 bo2)
+            funs1 funs2)
+    | x,y -> 
+        raise (Bad_pattern 
+                (Printf.sprintf "Pattern %s versus term %s" 
+                  (CicPp.ppterm x)
+                  (CicPp.ppterm y)))
+  and auxs context terms1 terms2 =  (* as aux for list of terms *)
+    List.concat (List.map2 (fun t1 t2 -> aux context t1 t2) terms1 terms2)
+  in
+   let roots = aux context where term in
+    match wanted with
+       None -> roots
+     | Some wanted ->
+        let rec find_in_roots =
+         function
+            [] -> []
+          | (context,where)::tl ->
+             let tl' = find_in_roots tl in
+             let found =
+              let wanted = CicSubstitution.lift (List.length context) wanted in
+               find_subterms ~wanted ~context where
+             in
+              found @ tl'
+        in
+         find_in_roots roots
+
+let pattern_of ?(equality=(==)) ~term terms =
+  let (===) x y = equality x y in
+  let rec aux t =
+    match t with
+    | t when List.exists (fun t' -> t === t') terms -> Cic.Implicit (Some `Hole)
+    | Cic.Var (uri, subst) -> Cic.Var (uri, aux_subst subst)
+    | Cic.Meta (i, ctxt) ->
+        let ctxt =
+          List.map (function None -> None | Some t -> Some (aux t)) ctxt
+        in
+        Cic.Meta (i, ctxt)
+    | Cic.Cast (t, ty) -> Cic.Cast (aux t, aux ty)
+    | Cic.Prod (name, s, t) -> Cic.Prod (name, aux s, aux t)
+    | Cic.Lambda (name, s, t) -> Cic.Lambda (name, aux s, aux t)
+    | Cic.LetIn (name, s, t) -> Cic.LetIn (name, aux s, aux t)
+    | Cic.Appl terms -> Cic.Appl (List.map aux terms)
+    | Cic.Const (uri, subst) -> Cic.Const (uri, aux_subst subst)
+    | Cic.MutInd (uri, tyno, subst) -> Cic.MutInd (uri, tyno, aux_subst subst)
+    | Cic.MutConstruct (uri, tyno, consno, subst) ->
+        Cic.MutConstruct (uri, tyno, consno, aux_subst subst)
+    | Cic.MutCase (uri, tyno, outty, t, pat) ->
+        Cic.MutCase (uri, tyno, aux outty, aux t, List.map aux pat)
+    | Cic.Fix (funno, funs) ->
+        let funs =
+          List.map (fun (name, i, ty, bo) -> (name, i, aux ty, aux bo)) funs
+        in
+        Cic.Fix (funno, funs)
+    | Cic.CoFix (funno, funs) ->
+        let funs =
+          List.map (fun (name, ty, bo) -> (name, aux ty, aux bo)) funs
+        in
+        Cic.CoFix (funno, funs)
+    | Cic.Rel _
+    | Cic.Sort _
+    | Cic.Implicit _ -> t
+  and aux_subst subst =
+    List.map (fun (uri, t) -> (uri, aux t)) subst
+  in
+  aux term
+