module PosEqSet : Set.S
with type elt = Utils.pos * Equality.equality
and type t = Equality_indexing.DT.PosEqSet.t
- type t = Discrimination_tree.DiscriminationTreeIndexing(PosEqSet).t
- type key = Cic.term
+ type t =
+ Discrimination_tree.Make(Cic_indexable.CicIndexable)(PosEqSet).t
end
+val check_for_duplicates : Cic.metasenv -> string -> unit
val index : Index.t -> Equality.equality -> Index.t
val remove_index : Index.t -> Equality.equality -> Index.t
val in_index : Index.t -> Equality.equality -> bool
val empty : Index.t
-val match_unif_time_ok : float ref
-val match_unif_time_no : float ref
-val indexing_retrieval_time : float ref
val init_index : unit -> unit
-val build_newtarget_time : float ref
+val unification :
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
+ Index.t ->
+ Equality.equality ->
+ (Subst.substitution * Equality.equality * bool) option
val subsumption :
Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
Equality.equality ->
- (Equality.substitution * Equality.equality) option
-val superposition_left :
- int ->
- Cic.conjecture list * Cic.context * CicUniv.universe_graph ->
+ (Subst.substitution * Equality.equality * bool) option
+val unification_all :
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
Equality.equality ->
- int * Equality.equality list
+ (Subst.substitution * Equality.equality * bool) list
+val subsumption_all :
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
+ Index.t ->
+ Equality.equality ->
+ (Subst.substitution * Equality.equality * bool) list
+val superposition_left :
+ Equality.equality_bag ->
+ Cic.conjecture list * Cic.context * CicUniv.universe_graph ->
+ Index.t -> Equality.goal ->
+ Equality.equality_bag * Equality.goal list
val superposition_right :
- int ->
- 'a * Cic.context * CicUniv.universe_graph ->
+ Equality.equality_bag ->
+ ?subterms_only:bool ->
+ UriManager.uri ->
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
Equality.equality ->
- int * Equality.equality list
+ Equality.equality_bag * Equality.equality list
+val demod :
+ Equality.equality_bag ->
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
+ Index.t ->
+ Equality.goal ->
+ bool * Equality.goal
val demodulation_equality :
+ Equality.equality_bag ->
?from:string ->
- int ->
+ UriManager.uri ->
Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
- Utils.equality_sign -> Equality.equality -> int * Equality.equality
+ Equality.equality -> Equality.equality_bag * Equality.equality
val demodulation_goal :
- int ->
+ Equality.equality_bag ->
Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
- (Equality.goal_proof * Equality.old_proof) * Cic.metasenv * Index.key ->
- bool * int *
- ((Equality.goal_proof * Equality.old_proof) * Cic.metasenv * Index.key)
-val demodulation_theorem :
- 'a ->
+ Equality.goal ->
+ bool * Equality.goal
+val demodulation_all_goal :
+ Equality.equality_bag ->
Cic.metasenv * Cic.context * CicUniv.universe_graph ->
Index.t ->
- Cic.term * Index.key * Cic.metasenv ->
- 'a * (Cic.term * Index.key * Cic.metasenv)
+ Equality.goal -> int ->
+ Equality.goal list
+val demodulation_theorem :
+ Equality.equality_bag ->
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
+ Index.t ->
+ Cic.term * Cic.term * Cic.metasenv
+ -> Cic.term * Cic.term
+
val check_target:
+ Equality.equality_bag ->
Cic.context ->
Equality.equality -> string -> unit
+val solve_demodulating:
+ Equality.equality_bag ->
+ Cic.metasenv * Cic.context * CicUniv.universe_graph ->
+ Index.t ->
+ Equality.goal ->
+ int ->
+ (Equality.equality_bag * Equality.goal_proof * Cic.metasenv *
+ Subst.substitution * Equality.proof) option