Shostak.Combineinclude Sig.Xval hash : r -> intval is_constant : r -> boolval fully_interpreted : Symbols.t -> boolval is_a_leaf : r -> boolval print : Stdlib.Format.formatter -> r -> unitval is_solvable_theory_symbol : Symbols.t -> boolto_model_term r creates a model term if r is constant. The function cannot fail if r is a constant (that is statisfied the predicate X.is_constant).
The returned value always satisfies the predicate Expr.is_model_term. See its documentation for more details about model terms.
val top : rval bot : r