proposition: Lemma all_finite_Ret : forall E R a, @all_finite E R (Ret a).
proof: Proof. intros; econstructor 1; reflexivity. Qed.
imports: ITree(ITree Basics.Utils Eq.Eqit Interp.TranslateFacts Leaf) ITree.Events(Nondeterminism Exception) Paco(paco) Coq(Morphisms Basics Program.Equality)