2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
17 | Node of ('a foterm) list
19 type 'a substitution = (int * 'a foterm) list
21 type comparison = Lt | Eq | Gt | Incomparable
23 type rule = SuperpositionRight | SuperpositionLeft | Demodulation
24 type direction = Left2Right | Right2Left | Nodir
25 type position = int list
29 | Step of rule * int * int * direction * position * 'a substitution
30 (* rule, eq1, eq2, direction of eq2, position, substitution *)
33 | Equation of 'a foterm (* lhs *)
35 * 'a foterm (* type *)
36 * comparison (* orientation *)
37 | Predicate of 'a foterm
39 type varlist = int list
45 * 'a proof (* proof *)
47 type 'a passive_clause = int * 'a unit_clause (* weight * equation *)
49 module M : Map.S with type key = int
51 type 'a bag = 'a unit_clause M.t
55 (* Blob is the type for opaque leaves:
56 * - checking equlity should be efficient
57 * - atoms have to be equipped with a total order relation
60 val eq : t -> t -> bool
61 val compare : t -> t -> int
62 (* TODO: consider taking in input an imperative buffer for Format
63 * val pp : Format.formatter -> t -> unit
67 val embed : t -> t foterm * int list
70 module Utils (B : Blob) :
72 val eq_foterm : B.t foterm -> B.t foterm -> bool
73 val compare_foterm : B.t foterm -> B.t foterm -> int
75 val eq_literal : B.t literal -> B.t literal -> bool
76 val compare_literal : B.t literal -> B.t literal -> int
78 val eq_unit_clause : B.t unit_clause -> B.t unit_clause -> bool
79 val compare_unit_clause : B.t unit_clause -> B.t unit_clause -> int