(************************************************************************) (* v * The Coq Proof Assistant / The Coq Development Team *) (* Loc.tag ?loc @@ CTacCst (AbsKn (Tuple 0)) | [e] -> e | el -> let len = List.length el in Loc.tag ?loc @@ CTacApp (Loc.tag ?loc @@ CTacCst (AbsKn (Tuple len)), el) let of_int (loc, n) = Loc.tag ?loc @@ CTacAtm (AtmInt n) let of_option ?loc f opt = match opt with | None -> constructor ?loc (coq_core "None") [] | Some e -> constructor ?loc (coq_core "Some") [f e] let inj_wit ?loc wit x = Loc.tag ?loc @@ CTacExt (wit, x) let of_variable (loc, id) = let qid = Libnames.qualid_of_ident id in if Tac2env.is_constructor qid then CErrors.user_err ?loc (str "Invalid identifier") else Loc.tag ?loc @@ CTacRef (RelId (Loc.tag ?loc qid)) let of_anti f = function | QExpr x -> f x | QAnti id -> of_variable id let of_ident (loc, id) = inj_wit ?loc wit_ident id let of_constr c = let loc = Constrexpr_ops.constr_loc c in inj_wit ?loc wit_constr c let of_open_constr c = let loc = Constrexpr_ops.constr_loc c in inj_wit ?loc wit_open_constr c let of_bool ?loc b = let c = if b then coq_core "true" else coq_core "false" in constructor ?loc c [] let rec of_list ?loc f = function | [] -> constructor (coq_core "[]") [] | e :: l -> constructor ?loc (coq_core "::") [f e; of_list ?loc f l] let of_qhyp (loc, h) = match h with | QAnonHyp n -> std_constructor ?loc "AnonHyp" [of_int n] | QNamedHyp id -> std_constructor ?loc "NamedHyp" [of_ident id] let of_bindings (loc, b) = match b with | QNoBindings -> std_constructor ?loc "NoBindings" [] | QImplicitBindings tl -> std_constructor ?loc "ImplicitBindings" [of_list ?loc of_open_constr tl] | QExplicitBindings tl -> let map e = of_pair (fun q -> of_anti of_qhyp q) of_open_constr e in std_constructor ?loc "ExplicitBindings" [of_list ?loc map tl] let of_constr_with_bindings c = of_pair of_open_constr of_bindings c let rec of_intro_pattern (loc, pat) = match pat with | QIntroForthcoming b -> std_constructor ?loc "IntroForthcoming" [of_bool b] | QIntroNaming iname -> std_constructor ?loc "IntroNaming" [of_intro_pattern_naming iname] | QIntroAction iact -> std_constructor ?loc "IntroAction" [of_intro_pattern_action iact] and of_intro_pattern_naming (loc, pat) = match pat with | QIntroIdentifier id -> std_constructor ?loc "IntroIdentifier" [of_anti of_ident id] | QIntroFresh id -> std_constructor ?loc "IntroFresh" [of_anti of_ident id] | QIntroAnonymous -> std_constructor ?loc "IntroAnonymous" [] and of_intro_pattern_action (loc, pat) = match pat with | QIntroWildcard -> std_constructor ?loc "IntroWildcard" [] | QIntroOrAndPattern pat -> std_constructor ?loc "IntroOrAndPattern" [of_or_and_intro_pattern pat] | QIntroInjection il -> std_constructor ?loc "IntroInjection" [of_intro_patterns il] | QIntroRewrite b -> std_constructor ?loc "IntroRewrite" [of_bool ?loc b] and of_or_and_intro_pattern (loc, pat) = match pat with | QIntroOrPattern ill -> std_constructor ?loc "IntroOrPattern" [of_list ?loc of_intro_patterns ill] | QIntroAndPattern il -> std_constructor ?loc "IntroAndPattern" [of_intro_patterns il] and of_intro_patterns (loc, l) = of_list ?loc of_intro_pattern l let of_hyp_location_flag ?loc = function | Locus.InHyp -> std_constructor ?loc "InHyp" [] | Locus.InHypTypeOnly -> std_constructor ?loc "InHypTypeOnly" [] | Locus.InHypValueOnly -> std_constructor ?loc "InHypValueOnly" [] let of_occurrences (loc, occ) = match occ with | QAllOccurrences -> std_constructor ?loc "AllOccurrences" [] | QAllOccurrencesBut occs -> let map occ = of_anti of_int occ in let occs = of_list ?loc map occs in std_constructor ?loc "AllOccurrencesBut" [occs] | QNoOccurrences -> std_constructor ?loc "NoOccurrences" [] | QOnlyOccurrences occs -> let map occ = of_anti of_int occ in let occs = of_list ?loc map occs in std_constructor ?loc "OnlyOccurrences" [occs] let of_hyp_location ?loc ((occs, id), flag) = of_tuple ?loc [ of_anti of_ident id; of_occurrences occs; of_hyp_location_flag ?loc flag; ] let of_clause (loc, cl) = let hyps = of_option ?loc (fun l -> of_list ?loc of_hyp_location l) cl.q_onhyps in let concl = of_occurrences cl.q_concl_occs in Loc.tag ?loc @@ CTacRec ([ std_proj "on_hyps", hyps; std_proj "on_concl", concl; ]) let of_destruction_arg (loc, arg) = match arg with | QElimOnConstr c -> let arg = thunk (of_constr_with_bindings c) in std_constructor ?loc "ElimOnConstr" [arg] | QElimOnIdent id -> std_constructor ?loc "ElimOnIdent" [of_ident id] | QElimOnAnonHyp n -> std_constructor ?loc "ElimOnAnonHyp" [of_int n] let of_induction_clause (loc, cl) = let arg = of_destruction_arg cl.indcl_arg in let eqn = of_option ?loc of_intro_pattern_naming cl.indcl_eqn in let as_ = of_option ?loc of_or_and_intro_pattern cl.indcl_as in let in_ = of_option ?loc of_clause cl.indcl_in in Loc.tag ?loc @@ CTacRec ([ std_proj "indcl_arg", arg; std_proj "indcl_eqn", eqn; std_proj "indcl_as", as_; std_proj "indcl_in", in_; ]) let check_pattern_id ?loc id = if Tac2env.is_constructor (Libnames.qualid_of_ident id) then CErrors.user_err ?loc (str "Invalid pattern binding name " ++ Id.print id) let pattern_vars pat = let rec aux () accu pat = match pat.CAst.v with | Constrexpr.CPatVar id | Constrexpr.CEvar (id, []) -> let () = check_pattern_id ?loc:pat.CAst.loc id in Id.Set.add id accu | _ -> Topconstr.fold_constr_expr_with_binders (fun _ () -> ()) aux () accu pat in aux () Id.Set.empty pat let abstract_vars loc vars tac = let get_name = function Name id -> Some id | Anonymous -> None in let def = try Some (List.find_map get_name vars) with Not_found -> None in let na, tac = match def with | None -> (Anonymous, tac) | Some id0 -> (** Trick: in order not to shadow a variable nor to choose an arbitrary name, we reuse one which is going to be shadowed by the matched variables anyways. *) let build_bindings (n, accu) na = match na with | Anonymous -> (n + 1, accu) | Name _ -> let get = global_ref ?loc (kername array_prefix "get") in let args = [of_variable (loc, id0); of_int (loc, n)] in let e = Loc.tag ?loc @@ CTacApp (get, args) in let accu = (Loc.tag ?loc @@ CPatVar na, e) :: accu in (n + 1, accu) in let (_, bnd) = List.fold_left build_bindings (0, []) vars in let tac = Loc.tag ?loc @@ CTacLet (false, bnd, tac) in (Name id0, tac) in Loc.tag ?loc @@ CTacFun ([Loc.tag ?loc @@ CPatVar na], tac) let of_pattern p = inj_wit ?loc:p.CAst.loc wit_pattern p let of_conversion (loc, c) = match c with | QConvert c -> let pat = of_option ?loc of_pattern None in let c = Loc.tag ?loc @@ CTacFun ([Loc.tag ?loc @@ CPatVar Anonymous], of_constr c) in of_tuple ?loc [pat; c] | QConvertWith (pat, c) -> let vars = pattern_vars pat in let pat = of_option ?loc of_pattern (Some pat) in let c = of_constr c in (** Order is critical here *) let vars = List.map (fun id -> Name id) (Id.Set.elements vars) in let c = abstract_vars loc vars c in of_tuple [pat; c] let of_repeat (loc, r) = match r with | QPrecisely n -> std_constructor ?loc "Precisely" [of_int n] | QUpTo n -> std_constructor ?loc "UpTo" [of_int n] | QRepeatStar -> std_constructor ?loc "RepeatStar" [] | QRepeatPlus -> std_constructor ?loc "RepeatPlus" [] let of_orient loc b = if b then std_constructor ?loc "LTR" [] else std_constructor ?loc "RTL" [] let of_rewriting (loc, rew) = let orient = let (loc, orient) = rew.rew_orient in of_option ?loc (fun b -> of_orient loc b) orient in let repeat = of_repeat rew.rew_repeat in let equatn = thunk (of_constr_with_bindings rew.rew_equatn) in Loc.tag ?loc @@ CTacRec ([ std_proj "rew_orient", orient; std_proj "rew_repeat", repeat; std_proj "rew_equatn", equatn; ]) let of_hyp ?loc id = let hyp = global_ref ?loc (control_core "hyp") in Loc.tag ?loc @@ CTacApp (hyp, [of_ident id]) let of_exact_hyp ?loc id = let refine = global_ref ?loc (control_core "refine") in Loc.tag ?loc @@ CTacApp (refine, [thunk (of_hyp ?loc id)]) let of_exact_var ?loc id = let refine = global_ref ?loc (control_core "refine") in Loc.tag ?loc @@ CTacApp (refine, [thunk (of_variable id)]) let of_dispatch tacs = let (loc, _) = tacs in let default = function | Some e -> thunk e | None -> thunk (Loc.tag ?loc @@ CTacCst (AbsKn (Tuple 0))) in let map e = of_pair default (fun l -> of_list ?loc default l) (Loc.tag ?loc e) in of_pair (fun l -> of_list ?loc default l) (fun r -> of_option ?loc map r) tacs let make_red_flag l = let open Genredexpr in let rec add_flag red = function | [] -> red | (_, flag) :: lf -> let red = match flag with | QBeta -> { red with rBeta = true } | QMatch -> { red with rMatch = true } | QFix -> { red with rFix = true } | QCofix -> { red with rCofix = true } | QZeta -> { red with rZeta = true } | QConst (loc, l) -> if red.rDelta then CErrors.user_err ?loc Pp.(str "Cannot set both constants to unfold and constants not to unfold"); { red with rConst = red.rConst @ l } | QDeltaBut (loc, l) -> if red.rConst <> [] && not red.rDelta then CErrors.user_err ?loc Pp.(str "Cannot set both constants to unfold and constants not to unfold"); { red with rConst = red.rConst @ l; rDelta = true } | QIota -> { red with rMatch = true; rFix = true; rCofix = true } in add_flag red lf in add_flag {rBeta = false; rMatch = false; rFix = false; rCofix = false; rZeta = false; rDelta = false; rConst = []} l let of_reference r = let of_ref ref = let loc = Libnames.loc_of_reference ref in inj_wit ?loc wit_reference ref in of_anti of_ref r let of_strategy_flag (loc, flag) = let open Genredexpr in let flag = make_red_flag flag in Loc.tag ?loc @@ CTacRec ([ std_proj "rBeta", of_bool ?loc flag.rBeta; std_proj "rMatch", of_bool ?loc flag.rMatch; std_proj "rFix", of_bool ?loc flag.rFix; std_proj "rCofix", of_bool ?loc flag.rCofix; std_proj "rZeta", of_bool ?loc flag.rZeta; std_proj "rDelta", of_bool ?loc flag.rDelta; std_proj "rConst", of_list ?loc of_reference flag.rConst; ]) let of_hintdb (loc, hdb) = match hdb with | QHintAll -> of_option ?loc (fun l -> of_list (fun id -> of_anti of_ident id) l) None | QHintDbs ids -> of_option ?loc (fun l -> of_list (fun id -> of_anti of_ident id) l) (Some ids) let extract_name ?loc oid = match oid with | None -> Anonymous | Some id -> let () = check_pattern_id ?loc id in Name id (** For every branch in the matching, generate a corresponding term of type [(match_kind * pattern * (context -> constr array -> 'a))] where the function binds the names from the pattern to the contents of the constr array. *) let of_constr_matching (loc, m) = let map (loc, ((ploc, pat), tac)) = let (knd, pat, na) = match pat with | QConstrMatchPattern pat -> let knd = constructor ?loc (pattern_core "MatchPattern") [] in (knd, pat, Anonymous) | QConstrMatchContext (id, pat) -> let na = extract_name ?loc id in let knd = constructor ?loc (pattern_core "MatchContext") [] in (knd, pat, na) in let vars = pattern_vars pat in (** Order of elements is crucial here! *) let vars = Id.Set.elements vars in let vars = List.map (fun id -> Name id) vars in let e = abstract_vars loc vars tac in let e = Loc.tag ?loc @@ CTacFun ([Loc.tag ?loc @@ CPatVar na], e) in let pat = inj_wit ?loc:ploc wit_pattern pat in of_tuple [knd; pat; e] in of_list ?loc map m (** From the patterns and the body of the branch, generate: - a goal pattern: (constr_match list * constr_match) - a branch function (ident array -> context array -> constr array -> context -> 'a) *) let of_goal_matching (loc, gm) = let mk_pat (loc, p) = match p with | QConstrMatchPattern pat -> let knd = constructor ?loc (pattern_core "MatchPattern") [] in (Anonymous, pat, knd) | QConstrMatchContext (id, pat) -> let na = extract_name ?loc id in let knd = constructor ?loc (pattern_core "MatchContext") [] in (na, pat, knd) in let mk_gpat (loc, p) = let concl_pat = p.q_goal_match_concl in let hyps_pats = p.q_goal_match_hyps in let (concl_ctx, concl_pat, concl_knd) = mk_pat concl_pat in let vars = pattern_vars concl_pat in let map accu (na, pat) = let (ctx, pat, knd) = mk_pat pat in let vars = pattern_vars pat in (Id.Set.union vars accu, (na, ctx, pat, knd)) in let (vars, hyps_pats) = List.fold_left_map map vars hyps_pats in let map (_, _, pat, knd) = of_tuple [knd; of_pattern pat] in let concl = of_tuple [concl_knd; of_pattern concl_pat] in let r = of_tuple [of_list ?loc map hyps_pats; concl] in let hyps = List.map (fun ((_, na), _, _, _) -> na) hyps_pats in let map (_, na, _, _) = na in let hctx = List.map map hyps_pats in (** Order of elements is crucial here! *) let vars = Id.Set.elements vars in let subst = List.map (fun id -> Name id) vars in (r, hyps, hctx, subst, concl_ctx) in let map (loc, (pat, tac)) = let (pat, hyps, hctx, subst, cctx) = mk_gpat pat in let tac = Loc.tag ?loc @@ CTacFun ([Loc.tag ?loc @@ CPatVar cctx], tac) in let tac = abstract_vars loc subst tac in let tac = abstract_vars loc hctx tac in let tac = abstract_vars loc hyps tac in of_tuple ?loc [pat; tac] in of_list ?loc map gm let of_move_location (loc, mv) = match mv with | QMoveAfter id -> std_constructor ?loc "MoveAfter" [of_anti of_ident id] | QMoveBefore id -> std_constructor ?loc "MoveBefore" [of_anti of_ident id] | QMoveFirst -> std_constructor ?loc "MoveFirst" [] | QMoveLast -> std_constructor ?loc "MoveLast" [] let of_pose p = of_pair (fun id -> of_option (fun id -> of_anti of_ident id) id) of_open_constr p let of_assertion (loc, ast) = match ast with | QAssertType (ipat, c, tac) -> let ipat = of_option of_intro_pattern ipat in let c = of_constr c in let tac = of_option thunk tac in std_constructor ?loc "AssertType" [ipat; c; tac] | QAssertValue (id, c) -> let id = of_anti of_ident id in let c = of_constr c in std_constructor ?loc "AssertValue" [id; c]