« first day (349 days earlier)      last day (608 days later) » 

Downgoat
Downgoat
00:19
@ASCII-only can u halp do type deduction pls :3
I am try to do backend rn but type deduct isn't finished yet and that's also important
Downgoat
Downgoat
01:06
@ASCII-only halo r u there
Downgoat
Downgoat
01:27
@ASCII-only good news: I solved mutual recursive subgraphs using symmetric representation and it worked :D 
F = P1{G, A}
G = P2{F, B}
problem was ^
to derive F' without subgraph
you'd get: 
F = P1|(P1{P1, P2 -> B}), A|
if I diid maths right
ASCII-only
ASCII-only
01:40
Halp idk what is hapne
@Downgoat is on npm
Downgoat
Downgoat
@ASCII-only oic
ok so there is this new problem that need to be solve
there is a function f defined as: 
f = P1|A -> G: P3|G:*| |
G = P2|f->P3|G:*|:*|
I need to find a new root predicate for f
which fullfill case where G or F would be execute without being in terms of G
@ASCII-only btw can we add (value) -> f syntax
 
2 hours later…
Downgoat
Downgoat
03:18
graph syntax highlighter
 
16 hours later…
Downgoat
Downgoat
19:10
@ASCII-only pls halp how 2 make quicksort implementation which dont use random and only recursion no loop

« first day (349 days earlier)      last day (608 days later) »