Source examples/symbolic/recursion-and-list.det
let dec = rec f x => if x <= 0 then 0 else f (x - 1) inlet z = dec 2 inlet xs = uniform(0, 1) :: [] inmatch xs with [] => z | h :: t => h + z