let myList = [for i in  0 .. 3  do yield  0 . 5  * float i]
let myList = [for i in  0 .. 3  ->  0 . 5  * float i]

let s = [ for i =  1  to  3  -> i ]

let s = [ for i =  1  to  3  do yield i ]

[ comp-or-range-expr] -- computed list expression
...
comp-or-range-expr :=
  comp-expr
  short-comp-expr
  range-expr

comp-expr :=
  let! pat = expr in comp-expr -- binding computation
  do! expr in comp-expr -- sequential computation
  use! pat = expr in comp-expr -- auto cleanup computation
  yield! expr -- yield computation
  yield expr -- yield result
  return! expr -- return computation
  return expr -- return result
  expr -- control flow or imperative action
-- !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
short-comp-expr :=
  for pat in expr-or-range-expr -> expr -- yield result

let tru = (fun t -> (fun f -> t))
let fls = (fun t -> (fun f -> f))
let test = (fun l -> (fun m -> (fun n -> l m n)))
let and_bool = (fun b -> (fun c -> (b c) fls))

let x = and_bool tru tru

tru = \t -> \f -> t
fls = \t -> \f -> f
test = \l -> \m -> \n -> l m n

and_bool = \b -> \c -> b c fls
or_bool = \b -> \c -> b tru c
not_bool = \b -> b fls tru

pair = \f -> \s -> \b -> b f s
first = \p -> p tru
second = \p -> p fls

c0 = \s -> \z -> z
c1 = scc c0
scc = \n -> \s -> \z -> s (n s z)
plus = \m -> \n -> \s -> \z -> m s (n s z)
times = \m -> \n -> m (plus n) c0
power  = \m -> \n -> n (times m) c1

iszro = \m -> m (\x -> fls) tru

zz = pair c0 c0
ss = \p -> pair (second p)(plus c1 (second p))
prd = \m -> first (m ss zz)
sub = \m -> \n -> n prd m

ch2st c = c ( 1 +)  0 
c3 = scc $ scc $ scc c0
c5 = scc $ scc c3

res = ch2st (sub c5 c3)