There's a couple of Fibonacci's on the wiki that uses this approach:
http://en.wikibooks.org/wiki/Clojure_Programming/Examples#Lazy_Fibonacci
On Mon, Feb 16, 2009 at 6:50 PM, Konrad Hinsen
wrote:
>
> I just discovered a nice feature that I don't remember having seen
> discussed or documented bef
I just discovered a nice feature that I don't remember having seen
discussed or documented before: there is a way to write recursive
functions without having them associated to any var/symbol in any
namespace. The optional name of a function can be used for a
recursive call. Example:
((fn
