On Mon, 24 May 2010, John Lato wrote:
I did note that you use causal arrows, however (at least from reading the paper) it seems that you aren't yet making use of the most significant contribution of the CCA framework, namely the algorithm to reduce any causal commutative arrow to a normal form of one function and an initial state.
My concrete arrows are always of the form initial state + state transition function. I see no place for optimization here.
I intended to use optimizer rules to vectorize the code. But satisfying vectorization needs some agreement by the user, thus it is simpler to write vectorised code from the beginning.
_______________________________________________ haskell-art mailing list [email protected] http://lists.lurk.org/mailman/listinfo/haskell-art
