Luc Tielen
LightNews LightNews
banner
luctielen.bsky.social
Luc Tielen
@luctielen.bsky.social
690 followers 210 following 71 posts
I talk about functional programming and compilers. Building a high performance Datalog called “eclair” with Haskell and LLVM.
Posts Replies Media Videos
luctielen.bsky.social
Something like this.. didn't run it or anything so probably contains bugs 😇, but it would give you a rough idea how to tackle it. And there's variations on this depending on the exact problem.
A Datalog code snippet to calculate the set of nodes k hops (k hardcoded to 5) away from a starting node. Below is the full snippet as plain text: ``` // using numbers to identify the nodes in the graph .decl edge(node_a: number, node_b: number) .decl reachable(node_a: number, node_b: number, hops: number) .decl max_hops(x: number) inline .decl start_node(node: number) .decl result(node_a: number, node_b: number) .input edge .input start_node .output result max_hops(5). // hardcoded for now, could be an input also reachable(node_a, node_b, 1) :- edge(node_a, node_b). reachable(node_a, node_b, x + 1) :- // first 2 clauses are optional, otherwise datalog would calculate *all* reachable paths transitively max_hops(y), x < y, reachable(node_a, node_b, x). result(start, end) :- start_node(start), // this filters results down significantly as well reachable(start, end, hops), max_hops(hops). ```
December 20, 2024 at 4:13 PM
luctielen.bsky.social
Mfw I see friends moving over to bsky:
A smiling Frodo waking up at the end of LOTR, right before reuniting with his friends
November 23, 2024 at 7:27 AM