You can also memoize recursive functions transparently with a memoizing fixed-point (Y) combinator: http://matt.might.net/articles/implementation-of-recursive-

You can also memoize recursive functions transparently with a memoizing fixed-point (Y) combinator: http://matt.might.net/articles/implementation-of-recursive-fixed-point-y-combinator-in-javascript-for-memoization/ http://matt.might.net/articles/implementation-of-recursive-f... The example is also Fibonacci.