Hacker News new | ask | show | jobs
by 082349872349872 1035 days ago
In principle, one can go back and forth between a visual node/graph dataflow representation and a textual expression-oriented dataflow representation. From an expression (better yet, an expression with either where clauses or labelled subexpressions) to the node/graph is pretty clear. The opposite direction is not as obvious, but still easy (cf Knuth Vol.4)

Once upon a time I had thought it might be worthwhile to use this correspondence to automatically structure definitions for human consumption, but currently I believe practicing programmers prefer to work with "definition soup" ...and leave the structuring to their optimising compilers.

1 comments

> go back and forth between a visual node/graph dataflow representation and a textual expression-oriented dataflow representation

Fascinating! I would LOVE to see that done well. (QoL PTSD adding the "well" in there for me. Haha)