LR

@lr.duangle.com

Account of Leonard Ritter (he/him, they/them). Arts, Maths, Metaprogramming & Nonsense; Game Developer at @duangle. paniq in the demoscene. Building Tukan, maintaining Scopes & gently going NOWHERE.

type ID : s32
set edge ID ID
set path ID ID
queue next_path ID ID

then edge ::
0 :: 1 2
1 3
3 4
2 4
4 :: 5 6

# rules for transitive closure
and # init path from edge
edge ?x ?y
then path x y

and # discover transitive closures
let x y z
# chained sub-products are evaluated disjunctively
and
new path x y # for every new insertion in path
path y z # for every edge starting at y
and
new path y z
path x y # for every edge ending in y
then next_path x z # add to queue
and
new next_path ?a ?b # work off queue
cue path a b # `cue` is like `then` but applies to next iteration

$# fizzbuzz evaluated in single top level iteration using import reduce # for sum_option # table of type sum_option and name "output", with one column of type string tables are container abstractions and the "vertices" of our data flow graph. sum_option output string # declare external C function; rawstring is `const char *` extern fn puts rawstring -> s32 # product that is evaluated once `out` is complete, see next block for more details about products. and # declare variable `str` in-place with `?` prefix output ?str _ = puts (str : rawstring) # cast str to rawstring before printing it assert str == S"1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n" # products are how we transfer data between tables. they are the "edges" of our data flow graph. specifically, each product is a hyperedge, so our graph is bipartite, with two vertex types: tables and products. and ?i = range 1 16 # generate numbers from i >= 1 to i < 16 # for each i: fold and # open a local fixed point iterative loop here we only have one product which completes in one iteration, so the fold section only serves to merge control flow. try # disjunctive product that may yield zero completions or # products conceptually evaluated in parallel and i % 3 == 0 then output S"Fizz" and i % 5 == 0 then output S"Buzz" else # execute this product if try has no completions then output (format "{}" i) # once for each i then output S"\n"$