implemented the obligatory fibonacci sequence in jn using tail recursion. tail recursion messes up type flow, so the recursive fib function returns object for now, but its getting there! source (with low level forms), abbreviated c# disassembly, output ✌🏽
a lot of decoupled systems are playing together quite nicely: type flow, call site specialization, function inlining, TCO, nop elimination. still a lot of work to do, but i am more confident that the basic architecture is robust.