type comparison = Lt | Eq | Gt | Incomparable
type rule = SuperpositionRight | SuperpositionLeft | Demodulation
+
+(* A Discrimination tree is a map: foterm |-> (dir, clause) *)
type direction = Left2Right | Right2Left | Nodir
+
type position = int list
type 'a proof =
module M : Map.S with type key = int
-type 'a bag = 'a unit_clause M.t
+type 'a bag = 'a unit_clause M.t
module type Blob =
sig
type t
val eq : t -> t -> bool
val compare : t -> t -> int
- val is_eq_predicate : t -> bool
+ val eqP : t
(* TODO: consider taking in input an imperative buffer for Format
* val pp : Format.formatter -> t -> unit
* *)