;;
(** finds the _pointers_ to subterms that are alpha-equivalent to wanted in t *)
-let find_subterms ~eq ~wanted t =
- let rec find w t =
- if eq w t then
- [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 _
fun acc e ->
match e with
| None -> acc
- | Some t -> find w t @ acc
+ | Some t -> find context w t @ acc
) [] ctx
- | Cic.Lambda (_, t1, t2)
- | Cic.Prod (_, t1, t2)
- | Cic.LetIn (_, t1, t2) ->
- find w t1 @ find (CicSubstitution.lift 1 w) t2
+ | 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 w t @ acc) [] l
- | Cic.Cast (t, ty) -> find w t @ find w ty
+ 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 w t @ acc) [] esubst
+ List.fold_left (fun acc (_, t) -> find context w t @ acc) [] esubst
| Cic.MutCase (_, _, outty, indterm, patterns) ->
- find w outty @ find w indterm @
- List.fold_left (fun acc p -> find w p @ acc) [] 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 w ty @ find w bo @ acc
+ 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 w ty @ find w bo @ acc
+ fun acc (_, ty, bo) ->
+ find context w ty @ find (tys @ context) w bo @ acc
) [] funl
in
- find wanted t
+ find context wanted t
-let select ~term ~pattern =
- let add_ctx i name entry =
- (Some (name, entry)) :: i
+let select ~context ~term ~pattern:(wanted,where) =
+ let add_ctx context name entry =
+ (Some (name, entry)) :: context
in
- (* i is the number of binder traversed *)
- let rec aux i pattern term =
- match (pattern, term) with
- | Cic.Implicit (Some `Hole), t -> [i,t]
+ 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 i 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 i te1 te2 @ aux i ty1 ty2
+ | 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 i s1 s2 @ aux (add_ctx i name (Cic.Decl s2)) t1 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 i s1 s2 @ aux (add_ctx i name (Cic.Decl s2)) t1 t2
+ 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 i s1 s2 @ aux (add_ctx i name (Cic.Def (s2,None))) t1 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 i s1 s2 @ aux (add_ctx i name (Cic.Def (s2,None))) t1 t2
+ 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 i terms1 terms2
+ | 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 i (List.map snd subst1) (List.map snd subst2)
+ auxs context (List.map snd subst1) (List.map snd subst2)
| Cic.MutCase (_, _, out1, t1, pat1), Cic.MutCase (_ , _, out2, t2, pat2) ->
- aux i out1 out2 @ aux i t1 t2 @ auxs i pat1 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 i ty1 ty2 @ aux i bo1 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 i ty1 ty2 @ aux i bo1 bo2)
+ (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 i terms1 terms2 = (* as aux for list of terms *)
- List.concat (List.map2 (fun t1 t2 -> aux i t1 t2) terms1 terms2)
+ 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
- aux [] pattern term
+ 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
projects / helm.git / blobdiff