hopefully these are the last warnings

theories/chan_lang/protocol.v

@@ -72,9 +72,9 @@ Instance prot_equiv {A} : Equiv (protocol A) := @prot_eq A.
 Global Instance prot_equivalence A: Equivalence (@equiv (protocol A) _).
 Proof. 
   split.
-  - now cofix; intros [ | | | | ]; constructor.
-  - now cofix; intros ?? [ | | | | ]; constructor.
-  - cofix; intros ???. inversion 1; inversion 1; econstructor; etrans; eauto.
+  - now cofix COFIX; intros [ | | | | ]; constructor.
+  - now cofix COFIX; intros ?? [ | | | | ]; constructor.
+  - cofix COFIX; intros ???. inversion 1; inversion 1; econstructor; etrans; eauto.
 Qed.
 
 Inductive prot_modc {T: Type} : protocol T → list choice → protocol T → Prop :=

theories/program_logic/refine_raw_adequacy.v

@@ -7,6 +7,9 @@ From fri.algebra Require Export irelations.
 From fri.algebra Require Import dra cmra_tactics base_logic.
 From fri.prelude Require Import set_finite_setoid list.
 From fri.program_logic Require Import language wsat adequacy_inf.
+From fri.algebra Require upred.
+Require ClassicalEpsilon.
+
 (* TODO: probably should NOT be using refine_ucmra directly the way I am -- should use the type,
    and then rely on canonical structure to find the ucmra stuff... because the workaround here breaks
    other stuff  *)
@@ -88,7 +91,7 @@ Definition refine v ts cs ixs : refine_cmra sΛ K :=
     (∃ cfg0 idx0, owne (refine master ∅ (cfg0 ++ [c]) idx0))%I.
   Definition master_own_exact (cs: list (cfg sΛ)) idxs := 
     owne (refine master ∅ cs idxs)%I.
-  From fri.algebra Require Import upred.
+  Import fri.algebra.upred.
 
   Definition snapshot_ownl tids (c: cfg sΛ) := 
     (∃ cfg0 idx0, ownle  (refine snapshot tids (cfg0 ++ [c]) idx0))%I.
@@ -421,7 +424,7 @@ Qed.
   Definition interp_step': nat → relation (interp_codomain) := λ i x y,
       idx_stepN 1 i (snap_vector x) (snap_vector y).
 
-  Require Import ClassicalEpsilon.
+  Import ClassicalEpsilon.
 
   Lemma some_interp_extract:
     ∀ (x: interp_codomain) (e: trace interp_step (Some x)),