Module `Th_lra.A`

module S : sig ... end

module Q : sig ... end

type term = S.T.Term.t
type ty = S.T.Ty.t

val view_as_lra : term -> (Q.t, term) Sidekick_arith_lra.lra_view
val mk_bool : S.T.Term.store -> bool -> term
val mk_lra : S.T.Term.store -> (Q.t, term) Sidekick_arith_lra.lra_view -> term
val ty_lra : S.T.Term.store -> ty
val mk_eq : S.T.Term.store -> term -> term -> term
val has_ty_real : term -> bool
val proof_lra : S.P.lit Iter.t -> S.P.t
val proof_lra_l : S.P.lit list -> S.P.t

module Gensym : sig ... end