[sledge] Refactor: Rename Formula.true_ and false_ to tt and ff

Reviewed By: ngorogiannis

Differential Revision: D22170510

fbshipit-source-id: 68f9581a6

sledge/src/fol.ml

@@ -96,6 +96,8 @@ module Formula = struct
 
   let inject b = b
   let project e = Some e
+  let tt = true_
+  let ff = false_
 
   let of_exp e =
     let b = Term.of_exp e in

sledge/src/fol.mli

@@ -131,8 +131,8 @@ and Formula : sig
   (** Construct *)
 
   (* constants *)
-  val true_ : t
-  val false_ : t
+  val tt : t
+  val ff : t
 
   (* comparisons *)
   val eq : Term.t -> Term.t -> t

sledge/src/sh.ml

@@ -33,7 +33,7 @@ let emp =
   { us= Var.Set.empty
   ; xs= Var.Set.empty
   ; ctx= Context.true_
-  ; pure= Formula.true_
+  ; pure= Formula.tt
   ; heap= []
   ; djns= [] }
 
@@ -508,7 +508,7 @@ let or_ q1 q2 =
       { us= Var.Set.union q1.us q2.us
       ; xs= Var.Set.empty
       ; ctx= Context.true_
-      ; pure= Formula.true_
+      ; pure= Formula.tt
       ; heap= []
       ; djns= [[q1; q2]] } )
   |>
@@ -553,7 +553,7 @@ let subst sub q =
   [%Trace.call fun {pf} -> pf "@[%a@]@ %a" Var.Subst.pp sub pp q]
   ;
   let dom, eqs =
-    Var.Subst.fold sub ~init:(Var.Set.empty, Formula.true_)
+    Var.Subst.fold sub ~init:(Var.Set.empty, Formula.tt)
       ~f:(fun var trm (dom, eqs) ->
         ( Var.Set.add dom var
         , Formula.and_ (Formula.eq (Term.var var) (Term.var trm)) eqs ) )

sledge/src/solver.ml

@@ -154,7 +154,7 @@ let excise_exists goal =
     let solutions_for_xs =
       let xs =
         Var.Set.diff goal.xs
-          (Sh.fv ~ignore_ctx:() (Sh.with_pure Formula.true_ goal.sub))
+          (Sh.fv ~ignore_ctx:() (Sh.with_pure Formula.tt goal.sub))
       in
       Context.solve_for_vars [Var.Set.empty; goal.us; xs] goal.sub.ctx
     in