Can we make interpreted G# closer in speed to compiled G#? For example, write a recursive Fibonacci function and measure its time getting the 33rd number in the sequence. Compare compiled to interpreted. Find ways to make the performance of the evaluator more closely match compiled code.
Can we make interpreted G# closer in speed to compiled G#? For example, write a recursive Fibonacci function and measure its time getting the 33rd number in the sequence. Compare compiled to interpreted. Find ways to make the performance of the evaluator more closely match compiled code.