(* From GuBPI Zaiser et al. -- MODIFIEDRemoved the soft conditioning and discretized the uniform(0,1) <= 0.5# depth 45# discretization 0 5 0.1# epsilonScore 0.02# outputSplitProgress 0# outputCurrentPath 1# outputCurrentArea 1# This SPCF program models a one-side random geometric walk where the size of the step grows with number of steps already taken (called growing-walk).# To make the program statistical, we include an observation that the walk has traveled 3 units.letrec f x = if (sample uniform(0,1) <= 0.5) then 0 else (x * sample uniform(0, 1)) + f(x+1)inlet t = f 1 inscore(pdfnormal(3.0, 1, t));tPartially determinizable but fully discrete; infinite state after determinization.*)let f = rec f x => if flip(0.5) then 0 else x * uniform(0, 1) + f (x + 1)inlet t = f 1 int