proposition: Lemma bind_ret : forall {E R S} (r : R) (k : R -> itree E S), ITree.bind (Ret r) k ≈ k r.
proof: Proof. intros; rewrite ITree.Eq.Shallow.bind_ret_; reflexivity. Qed.
imports: Coq(Setoid Morphisms) ITree(Eq.Shallow) ITree.Core.ITreeDefinition ITree.Basics.Basics ITree.Indexed.Sum ITree.Interp.Interp ITree.Interp.Recursion ITree(Eq.Eqit Eq.UpToTaus Interp.InterpFacts Interp.RecursionFacts)