type rule = SuperpositionRight | SuperpositionLeft | Demodulation
+(* every equality group has its own bag. the bag contains the infos necessary
+ * for building the proof. FIXME: should also contain maxmeta! *)
+type equality_bag
+
+val mk_equality_bag: unit -> equality_bag
+
type equality
and proof =
and goal_proof = (rule * Utils.pos * int * Subst.substitution * Cic.term) list
+type goal = goal_proof * Cic.metasenv * Cic.term
+
val pp_proof:
+ equality_bag ->
(Cic.name option) list -> goal_proof -> proof -> Subst.substitution -> int ->
Cic.term -> string
-val reset : unit -> unit
+val draw_proof:
+ equality_bag ->
+ (Cic.name option) list -> goal_proof -> proof -> int -> unit
+val pp_proofterm: Cic.term -> string
+
val mk_equality :
- int * proof *
+ equality_bag -> int * proof *
(Cic.term * Cic.term * Cic.term * Utils.comparison) *
Cic.metasenv ->
equality
val mk_tmp_equality :
- int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv ->
+ int * (Cic.term * Cic.term * Cic.term * Utils.comparison) * Cic.metasenv ->
equality
val open_equality :
int * proof *
(Cic.term * Cic.term * Cic.term * Utils.comparison) *
Cic.metasenv * int
-val depend : equality -> int -> bool
+val depend : equality_bag -> equality -> int -> bool
val compare : equality -> equality -> int
-val string_of_equality : ?env:Utils.environment -> equality -> string
+val max_weight_in_proof : equality_bag -> int -> proof -> int
+val max_weight : equality_bag -> goal_proof -> proof -> int
+val string_of_equality :
+ ?env:Utils.environment -> equality -> string
val string_of_proof :
- ?names:(Cic.name option)list -> proof -> goal_proof -> string
+ ?names:(Cic.name option)list -> equality_bag -> proof -> goal_proof -> string
(* given a proof and a list of meta indexes we are interested in the
* instantiation gives back the cic proof and the list of instantiations *)
(* build_goal_proof [eq_URI] [goal_proof] [initial_proof] [ty]
* [ty] is the type of the goal *)
val build_goal_proof:
+ equality_bag ->
UriManager.uri -> goal_proof -> proof -> Cic.term-> int list ->
+ Cic.context -> Cic.metasenv ->
Cic.term * Cic.term list
+val build_proof_term :
+ equality_bag ->
+ UriManager.uri -> (int * Cic.term) list -> int -> proof -> Cic.term
val refl_proof: UriManager.uri -> Cic.term -> Cic.term -> Cic.term
(** ensures that metavariables in equality are unique *)
-val fix_metas: int -> equality -> int * equality
-val metas_of_proof: proof -> int list
+val fix_metas_goal: int -> goal -> int * goal
+val fix_metas: equality_bag -> int -> equality -> int * equality
+val metas_of_proof: equality_bag -> proof -> int list
+(* this should be used _only_ to apply (efficiently) this subst on the
+ * initial proof passed to build_goal_proof *)
val add_subst : Subst.substitution -> proof -> proof
exception TermIsNotAnEquality;;
raises TermIsNotAnEquality if term is not an equation.
The first Cic.term is a proof of the equation
*)
-val equality_of_term: Cic.term -> Cic.term -> equality
+val equality_of_term: equality_bag -> Cic.term -> Cic.term -> equality
(**
Re-builds the term corresponding to this equality
(** meta convertibility between two equations *)
val meta_convertibility_eq: equality -> equality -> bool
+val meta_convertibility_subst:
+ Cic.term -> Cic.term -> Cic.metasenv -> Cic.substitution option
val is_weak_identity: equality -> bool
val is_identity: Utils.environment -> equality -> bool
* [eq_ty] the ty of the equality sides
*)
val symmetric:
- Cic.term -> Cic.term -> int -> UriManager.uri ->
+ equality_bag -> Cic.term -> Cic.term -> int -> UriManager.uri ->
Cic.metasenv -> proof
(* takes 3 lists of alive ids (they are threated the same way, the type is
* funny just to not oblige you to concatenate them) and drops all the dead
* equalities *)
-val collect: int list -> int list -> int list -> unit
+val collect: equality_bag -> int list -> int list -> int list -> unit
(* given an equality, returns the numerical id *)
val id_of: equality -> int