Correct readme's Fibonacci example
Correct readme's Fibonacci example

It was totally wrong.  Oooops.

The infinite recursion would also overflow the stack (except if ES6 gets
proper tail recursion, in which case it would just loop forever, but I
digress).  It could get confusing.

martindale/eslisp,anko/eslisp,jabbrass/eslisp,whacked/eslisp