Iteractive Fibonacci example

[Dale Schumacher]

During yesterday's friam call we explored iterative calculation of Fibonacci numbers as a demonstration of techniques for implementing functional closure activations and parallel list processing using pure actors in uFork assembly language. For future reference, the code for this example has been published at https://ufork.org/playground/?src=../debugger/examples/fib_iter.asm

[Douglas Crockford]

This is how I did it in The Good Parts:

 var memoizer = function (memo, formula) {

    var recur = function (n) {
        var result = memo[n];
        if (typeof result !== 'number') {
            result = formula(recur, n);
            memo[n] = result;
        }
        return result;
    };
    return recur;
};
var fibonacci = memoizer([0, 1], function (recur, n) {
    return recur(n - 1) + recur(n - 2);
});

[Dale Schumacher]

This is an elegant example using higher-order functional closures and shared mutable state. However, the memory-safe assembly language of uFork has neither of these mechanisms, so compiler-writers will need to build semantic equivalents using pure share-nothing actors and immutable message data. We look forward to illustrating this (eventually) with a compiler for Misty.

--
You received this message because you are subscribed to the Google Groups "friam" group.
To unsubscribe from this group and stop receiving emails from it, send an email to friam+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/friam/67d5c48b-27c9-4de7-baf3-45de2024b413n%40googlegroups.com.