[<<][staapl][>>][..]
Wed Jul 22 12:41:53 CEST 2009

DFL next

Implement primitives.  Ha! primitives are multivalued functions :)

The basic idea is this: I'm not going to bother with making dataflow
networks that can be processed as data structure.  For this it's
better to use techniques similar to dfl-sort-graph that operate on
source code directly.  The point is eventually to be able to run the
DFL statements, so it looks like it's simplest to make sure the
dfl-compose / dfl-sequence operation maps scheme functions to a scheme
function, so DFL programs mesh well with other scheme programs.

Which is exactly what it already did..



[Reply][About]
[<<][staapl][>>][..]