« first day (348 days earlier)      last day (609 days later) » 

17:49
@ASCII-only ok did think and i found solution to recursion problem
i think good solution because it works nicely with conditinoals
you have:
where G is the fallthrough branch
so for an empty loop we'd use:
as $\lambda$ is identity
$P$ is our predicate for the loop
If you look at the conditional no-op it is practically same:
but as you can see there is , instead of semicolon
which brings to question
what kind of branching model do we want to use
if we use Mapping (e.g. P(a_1) -> A_1, ... P(a_n) -> A_n) then it does not work very nice with loops but then we have very efficient and fast lookup tables and collapsable conditions
if we use binary branching with P(x) -> A else B then we can probably link it with loops allowing both to be optimized together
18:23
here you can see why P|A:B| is equal to P|pA:pB|
we have to encapsulate A & B as identities for symmetry
 
3 hours later…
21:03
@ASCII-only can u pls add while to VSL
I want to test compiling something
 
1 hour later…
22:12
@ASCII-only halo
@Downgoat I thought is already add
@Downgoat protobuf, kryo might work but idk how good node kryo is
@ASCII-only idk gives bork:
vsl::asts> while true { 1 + 1 }
Error: Must implement Node#children

    Error: Must implement Node#children
        at WhileStatement.get (/home/ubuntu/workspace/lib/vsl/parser/nodes/node.js:178:19)
        at WhileStatement.toAst (/home/ubuntu/workspace/lib/vsl/parser/nodes/node.js:105:32)
        at CodeBlock.toAst (/home/ubuntu/workspace/lib/vsl/parser/nodes/node.js:130:85)
        at asts (/home/ubuntu/workspace/lib/cli/mode/debugsrc.js:733:40)
        at Default._callee7$ (/home/ubuntu/workspace/lib/cli/mode/debugsrc.js:682:33)
@ASCII-only link? can't find on googl

« first day (348 days earlier)      last day (609 days later) »