fact: Definition lowDistApprox_ls (A : Set)(c : Comp A) a n (ls : Blist) r := exists vals count, rel_map (fun s v => (evalDet c (ls ++ s) v)) (getAllBlists n) vals /\ pred_count (eq (ca_done a)) vals count /\ count /expnat 2 n == r.
imports: FCF.Comp FCF.DetSem FCF.DistSem FCF.Rat Arith FCF.StdNat FCF.Fold FCF.Limit Permutation ZifyNat