3 ms·
For DAGs, I'm guessing it's better to use some sort of let/where notation, because doing the APL/Lisp Reader thing of naming a defining use and then referring t
by 082349872349872 4y ago
For DAGs, I'm guessing it's better to use some sort of let/where notation, because doing the APL/Lisp Reader thing of naming a defining use and then referring to it elsewhere involves an arbitrary choice of which instance to use as the def'n.
eg. for a mean of the first few even nats:
(/)
├─(sum)
│ └─(by)
│ ├─(,..)
│ │ ├─0
│ │ └─8
│ └─2
└─(len)
└─(by)
├─(,..)
│ ├─0
│ └─8
└─2
I think I'd prefer:
(/) #0:(by)
├─(sum) ├─(,..)
│ └─#0 │ ├─0
└─(len) │ └─8
└─#0 └─2
to:
(/)
├─(sum)
│ └─#0:(by)
│ ├─(,..)
│ │ ├─0
│ │ └─8
│ └─2
└─(len)
└─#0
although there's still an arbitrary decision to make as to how to order references when there's more than one dup, so maybe picking an encounter order as in the latter is as good as it gets?
- BruceEel 4y agoGood one, should stay pretty readable for non-trivial graphs. And I agree, as-found-on-traversal ordering is likely as good as any other. I guess the Dream DAG would be some sort interactive zoom&click to expand thing, probably beyond my use case (and certainly beyond my console programming knowledge!)