let f = if true then (rec f x => if x < 0 then f (x + 1) else uniform[G](0,1)) else (fun x => uniform[E](0,1))inlet sum = rec sum xs => match xs with [] => 0 | x::xs => x + sum xs insum (f (-2) :: uniform[E](0,1) :: [])
let f = if true then (rec f x => if x < 0 then f (x + 1) else uniform[G](0,1)) else (fun x => uniform[E](0,1))inlet sum = rec sum xs => match xs with [] => 0 | x::xs => x + sum xs insum (f (-2) :: uniform[E](0,1) :: [])