29 Dec
2006
29 Dec
'06
12:39 p.m.
On Tue, Dec 26, 2006 at 09:56:11PM -0500, Steve Schafer wrote:
But that isn't quite the case. Each step consumes not only the results of the previous step, but also some combination of the results of prior steps and/or the original inputs. One way to look at this is a directed graph, a sort of "branching pipeline"; see http://www.dendroica.com/Scratch/process.png.
Why not generate Haskell code from such a graph? Best regards Tomasz