proposition: Lemma horner_seq u p x : horner u p x = C.mask (foldr (fun a b => C.add u (C.mul u b x) a) C.zero (toSeq p)) x.
proof: Proof. done. Qed.
imports: Coq(ZArith Reals) Coquelicot(Coquelicot) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Flocq(Core) Stdlib MathComp Interval Xreal Basic_rec