fact: Definition _interp_state {E F S R} (f : E ~> stateT S (itree F)) (ot : itreeF E R _) : stateT S (itree F) R := fun s => match ot with | RetF r => Ret (s, r) | TauF t => Tau (interp_state f t s) | VisF e k => f _ e s >>= (fun sx => Tau (interp_state f (k (snd sx)) (fst sx))) end.
imports: Coq(Program.Tactics Morphisms) Paco(paco) ITree(Basics.Basics Basics.Category Basics.CategoryKleisli Basics.HeterogeneousRelations Basics.Monad Core.ITreeDefinition Core.KTree Core.KTreeFacts Eq.Eqit Eq.UpToTaus Eq.Paco2 Indexed.Sum Interp.Interp Interp.InterpFacts Interp.RecursionFacts Events.State)