fact: Definition foldM `{Monad m} {A B : Type} (f : A → B → m A) (s : A) (l : list B) : m A := let fix go xs z := match xs with | nil => pure z | cons y ys => f z y >>= go ys end in go l s.
imports: Coq.Lists.List Equations(Equations) Equations.Type.EqDec Category.Lib Category.Theory.Coq.Functor Category.Theory.Coq.Applicative Category.Theory.Coq.Monad Category.Theory.Coq.Maybe Coq.Lists.List