Charts Lambda
From PublicWiki
Go back to Chart_research for some perspective.
If I have a node defined as:
(x, y : f, g) d
This means that d is a piece of code that supplies two functions f(x, y) and g(x,y).
If I have the following definitions:
(x : h) dee
(x : f) [ (x : g) da
(g : h_of_g) dee ]
Then the code in da defines g(x) and the code in dee defines h(x); in this case f(x)=h(g(x)).
The channels in and out are abstract functions; the realization of their node represents how they will actually be computed, and the associations between them.
