fact: Fixpoint Rediv_rec_loop (q : polyF) sq cq (c : nat) (qq r : polyF) (n : nat) {struct n} : cps (nat * polyF * polyF) := fun k => bind sr <- Size r; if (sr < sq)%N then k (c, qq, r) else bind lr <- LeadCoef r; let m := AmulXn lr (sr - sq) in let qq1 := (qq ** [::cq] ++ m)%qfT in let r1 := (r ** [::cq] -- m ** q)%qfT in if n is n1.+1 then Rediv_rec_loop q sq cq c.+1 qq1 r1 n1 k else k (c.+1, qq1, r1).
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(finfun path matrix) mathcomp(bigop order ssralg poly polydiv ssrnum zmodp div ssrint) mathcomp(polyorder polyrcf interval polyXY) mathcomp(qe_rcf_th ordered_qelim mxtens)