Hintsval decompose_app_bound :
Environ.env ->
Evd.evar_map ->
EConstr.constr ->
Names.GlobRef.t * EConstr.constr arrayval secvars_of_hyps : Environ.named_context_val -> Names.Id.Pred.tval empty_hint_info : 'a Typeclasses.hint_info_genval hint_cat : Libobject.categoryPre-created hint databases
type hint_ast = | Res_pf of hint| ERes_pf of hint| Give_exact of hint| Res_pf_THEN_trivial_fail of hint| Unfold_nth of Evaluable.t| Extern of Pattern.constr_pattern option * Gentactic.glob_generic_tacticval hint_as_term : hint -> UnivGen.sort_context_set option * EConstr.constrtype hints_path_atom = Names.GlobRef.t hints_path_atom_genmodule FullHint : sig ... endThe head may not be bound.
type 'a hints_path_gen = | PathAtom of 'a hints_path_atom_gen| PathStar of 'a hints_path_gen| PathSeq of 'a hints_path_gen * 'a hints_path_gen| PathOr of 'a hints_path_gen * 'a hints_path_gen| PathEmpty| PathEpsilontype pre_hints_path = Libnames.qualid hints_path_gentype hints_path = Names.GlobRef.t hints_path_genval path_matches_epsilon : hints_path -> boolval path_derivate :
Environ.env ->
hints_path ->
Names.GlobRef.t option ->
hints_pathval pp_hints_path_gen : ('a -> Pp.t) -> 'a hints_path_gen -> Pp.tval parse_mode : string -> hint_modeval parse_modes : string -> hint_mode listval string_of_mode : hint_mode -> stringval glob_hints_path : pre_hints_path -> hints_pathmodule Modes : sig ... endmodule Hint_db : sig ... endtype hint_db = Hint_db.ttype hints_entry = | HintsResolveEntry of (Typeclasses.hint_info * hnf * Names.GlobRef.t) list| HintsImmediateEntry of Names.GlobRef.t list| HintsCutEntry of hints_path| HintsUnfoldEntry of Evaluable.t list| HintsTransparencyEntry of Evaluable.t hints_transparency_target * bool| HintsModeEntry of Names.GlobRef.t * hint_mode list| HintsExternEntry of Typeclasses.hint_info * Gentactic.glob_generic_tacticval searchtable_map : hint_db_name -> hint_dbval searchtable_add : (hint_db_name * hint_db) -> unitcreate_hint_db local name st use_dn. st is a transparency state for unification using this db use_dn switches the use of the discrimination net for all hints and patterns.
val create_hint_db : bool -> hint_db_name -> TransparentState.t -> bool -> unitval remove_hints :
locality:hint_locality ->
hint_db_name list ->
Names.GlobRef.t list ->
unitval current_db_names : unit -> Util.String.Set.tval current_pure_db : unit -> hint_db listval add_hints :
locality:hint_locality ->
hint_db_name list ->
hints_entry ->
unitA constr which is Hint'ed will be:
val push_resolves :
Environ.env ->
Evd.evar_map ->
Names.GlobRef.t ->
Hint_db.t ->
Hint_db.tpush_resolve_hyp hname htyp db. used to add an hypothesis to the local hint database; Never raises a user exception; If the hyp cannot be used as a Hint, it is not added.
val push_resolve_hyp :
Environ.env ->
Evd.evar_map ->
Names.Id.t ->
Hint_db.t ->
Hint_db.tCreate a Hint database from the pairs (name, constr). Useful to take the current goal hypotheses as hints; Boolean tells if lemmas with evars are allowed
val make_local_hint_db :
Environ.env ->
Evd.evar_map ->
?ts:TransparentState.t ->
bool ->
Names.GlobRef.t list ->
hint_dbval make_db_list : hint_db_name list -> hint_db listval fresh_hint :
Environ.env ->
Evd.evar_map ->
hint ->
Evd.evar_map * EConstr.constrval hint_res_pf :
?with_evars:bool ->
?with_classes:bool ->
?flags:Unification.unify_flags ->
hint ->
unit Proofview.tacticPrinting hints
val pr_searchtable : Environ.env -> Evd.evar_map -> Pp.tval pr_hint_ref : Environ.env -> Evd.evar_map -> Names.GlobRef.t -> Pp.tval pr_hint_db_by_name : Environ.env -> Evd.evar_map -> hint_db_name -> Pp.tval pr_hint_db_env : Environ.env -> Evd.evar_map -> Hint_db.t -> Pp.t