[<<][meta_siso][>>][..]
Thu Aug 20 11:03:58 EDT 2015

While loop

While loop with accumulator init.

  info "while" $ compTest (while (\x -> eq x x)
                                 (\x -> add x x)
                                 zero :: Comp CI)

-- while:
r0 = 0, while
  r1 = eq[r0,r0]
  out r1
    r2 = add[r0,r0]
    out r2
out r0


Together with array indexing, this means fold can be removed as a
primitive.

Seems to work, but missing is vector representation.



[Reply][About]
[<<][meta_siso][>>][..]