fact: Parameter interp_vis : forall {E F R} {f : E ~> itree F} U (e: E U) (k: U -> itree E R), interp f (Vis e k) ≈ ITree.bind (f _ e) (fun x => interp f (k x)).
imports: Coq(Setoid Morphisms) ITree(Eq.Shallow) ITree.Core.ITreeDefinition ITree.Basics.Basics ITree.Indexed.Sum ITree.Interp.Interp ITree.Interp.Recursion