Module Cc_plugin.Ccalgo

type pa_constructor = {
cnode : int;
arity : int;
args : int list;
}
type cinfo = {
ci_constr : Constr.pconstructor;
ci_arity : int;
ci_nhyps : int;
}
type 'a term
module ATerm : sig ... end
type ccpattern =
| PApp of ATerm.t * ccpattern list
| PVar of int * ccpattern list
type axiom
val constr_of_axiom : axiom -> Constr.constr
type rule =
| Congruence
| Axiom of axiom * bool
| Injection of int * pa_constructor * int * pa_constructor * int
type from =
| Goal
| Hyp of Constr.constr
| HeqG of Names.Id.t
| HeqnH of Names.Id.t * Names.Id.t
type 'a eq = {
lhs : int;
rhs : int;
rule : 'a;
}
type equality = rule eq
type disequality = from eq
type patt_kind =
| Normal
| Trivial of Constr.types
| Creates_variables
type forest
type state
type explanation =
| Discrimination of int * pa_constructor * int * pa_constructor
| Contradiction of disequality
| Incomplete
val debug_congruence : CDebug.t
val forest : state -> forest
val axioms : forest -> axiom -> ATerm.t * ATerm.t
val epsilons : forest -> pa_constructor list
val empty : Environ.env -> Evd.evar_map -> int -> state
val add_aterm : state -> ATerm.t -> int
val add_equality : state -> Names.Id.t -> ATerm.t -> ATerm.t -> unit
val add_disequality : state -> from -> ATerm.t -> ATerm.t -> unit
val add_quant : state -> Names.Id.t -> bool -> (int * patt_kind * ccpattern * patt_kind * ccpattern) -> unit
val tail_pac : pa_constructor -> pa_constructor
val find_oldest_pac : forest -> int -> pa_constructor -> int
val aterm : forest -> int -> ATerm.t
val get_constructor_info : forest -> int -> cinfo
val subterms : forest -> int -> int * int
val join_path : forest -> int -> int -> ((int * int) * equality) list * ((int * int) * equality) list
val execute : bool -> state -> explanation option
val pr_idx_term : Environ.env -> Evd.evar_map -> forest -> int -> Pp.t