Fri May 24 15:39:19 EDT 2013
The current version of Feldspar deals only with pure data
processing; although, we have initiated work to extend the
language to encompass control.
It looks like they avoided feedback state.
- Symbolic arrays: map f (Indexed l ixf) = Indexed l (f . ixf)
Maybe the idea of symbolic arrays can be reused. Currently I rely on
type inference, but to abstract the indexing procedure in the form of
curried functions is a possibility.
Basically, given an opaque node `s' that is passed to a map function
will return a new opaque node s. The map doesn't need to be forced
until the type is known. Let's give this a try.