+
+let select ~term ~pattern =
+ let add_ctx i name entry =
+ (Some (name, entry)) :: i
+ 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]
+ | 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 | _ -> []))
+ ctxt1 ctxt2)
+ | Cic.Cast (te1, ty1), Cic.Cast (te2, ty2) -> aux i te1 te2 @ aux i ty1 ty2
+ | Cic.Prod (_, s1, t1), Cic.Prod (name, s2, t2)
+ | Cic.Lambda (_, s1, t1), Cic.Lambda (name, s2, t2) ->
+ aux i s1 s2 @ aux (add_ctx i name (Cic.Decl s2)) t1 t2
+ | Cic.LetIn (_, s1, t1), Cic.LetIn (name, s2, t2) ->
+ aux i s1 s2 @ aux (add_ctx i name (Cic.Def (s2,None))) t1 t2
+ | Cic.Appl terms1, Cic.Appl terms2 -> auxs i 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)
+ | Cic.MutCase (_, _, out1, t1, pat1), Cic.MutCase (_ , _, out2, t2, pat2) ->
+ aux i out1 out2 @ aux i t1 t2 @ auxs i pat1 pat2
+ | Cic.Fix (_, funs1), Cic.Fix (_, funs2) ->
+ List.concat
+ (List.map2
+ (fun (_, _, ty1, bo1) (_, _, ty2, bo2) ->
+ aux i ty1 ty2 @ aux i bo1 bo2)
+ funs1 funs2)
+ | Cic.CoFix (_, funs1), Cic.CoFix (_, funs2) ->
+ List.concat
+ (List.map2
+ (fun (_, ty1, bo1) (_, ty2, bo2) -> aux i ty1 ty2 @ aux i 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)
+ in
+ aux [] pattern term
+
+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
+