proposition: Lemma rec_as_interp : forall {E A B} (f : A -> itree (callE A B +' E) B) (a : A), rec f a ≈ interp (recursive f) (f a).
proof: Proof. intros. rewrite ITree.Interp.RecursionFacts.rec_as_interp. 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)