Comment by almostgotcaught 1 year ago > a directed graph of operationsWhat syntax do you know that can represent a dag in text? 9 comments almostgotcaught Reply mr_toad 1 year ago Something like the DOT language used in GraphVizhttps://graphviz.org/doc/info/lang.html almostgotcaught 1 year ago Yes DOT (and the other UML whatever languages) are absolutely the only extant examples that make an attempt. But again, if you look at DOT you'll see it doesn't actually do anything syntactically - it just has syntax for edge lists. cha42 1 year ago Any syntax with a let operator to name stuff or a lambda abstraction. almostgotcaught 1 year ago That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names). mathnmusic 1 year ago Isn't this fan-in?let A = select * from tblalet B = select * from tblblet C = select * from A join B 1 reply → RyanHamilton 1 year ago A = select * from tblaB = select * from tblbC = select * from A join B wtetzner 1 year ago I guess CTEs already provide that (even if they're a bit clunky). WITH a AS (select * from tbla), b AS (select * from tblb) select * from a join b almostgotcaught 1 year ago Yes we already have that, it's called `async def`.
mr_toad 1 year ago Something like the DOT language used in GraphVizhttps://graphviz.org/doc/info/lang.html almostgotcaught 1 year ago Yes DOT (and the other UML whatever languages) are absolutely the only extant examples that make an attempt. But again, if you look at DOT you'll see it doesn't actually do anything syntactically - it just has syntax for edge lists.
almostgotcaught 1 year ago Yes DOT (and the other UML whatever languages) are absolutely the only extant examples that make an attempt. But again, if you look at DOT you'll see it doesn't actually do anything syntactically - it just has syntax for edge lists.
cha42 1 year ago Any syntax with a let operator to name stuff or a lambda abstraction. almostgotcaught 1 year ago That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names). mathnmusic 1 year ago Isn't this fan-in?let A = select * from tblalet B = select * from tblblet C = select * from A join B 1 reply →
almostgotcaught 1 year ago That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names). mathnmusic 1 year ago Isn't this fan-in?let A = select * from tblalet B = select * from tblblet C = select * from A join B 1 reply →
mathnmusic 1 year ago Isn't this fan-in?let A = select * from tblalet B = select * from tblblet C = select * from A join B 1 reply →
RyanHamilton 1 year ago A = select * from tblaB = select * from tblbC = select * from A join B wtetzner 1 year ago I guess CTEs already provide that (even if they're a bit clunky). WITH a AS (select * from tbla), b AS (select * from tblb) select * from a join b almostgotcaught 1 year ago Yes we already have that, it's called `async def`.
wtetzner 1 year ago I guess CTEs already provide that (even if they're a bit clunky). WITH a AS (select * from tbla), b AS (select * from tblb) select * from a join b
Something like the DOT language used in GraphViz
https://graphviz.org/doc/info/lang.html
Yes DOT (and the other UML whatever languages) are absolutely the only extant examples that make an attempt. But again, if you look at DOT you'll see it doesn't actually do anything syntactically - it just has syntax for edge lists.
Any syntax with a let operator to name stuff or a lambda abstraction.
That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names).
Isn't this fan-in?
let A = select * from tbla
let B = select * from tblb
let C = select * from A join B
1 reply →
A = select * from tbla
B = select * from tblb
C = select * from A join B
I guess CTEs already provide that (even if they're a bit clunky).
Yes we already have that, it's called `async def`.