Re:What is the asymptotic cost of purely functional programm...
by chimeracoder on Wednesday April 11, 2012 @05:10PM
(#3829662)
Yeah, in case it wasn't clear, by my second reply I was just being facetious.
Pedantry is infinitely recursive, with no base case in sight and no tail optimization - my tolerance/stack for these things overflows rather quickly. :-)
But thanks for the link! I'll be sure to check it out later; it looks interesting.
Pedantry is infinitely recursive, with no base case in sight and no tail optimization - my tolerance/stack for these things overflows rather quickly. :-)
But thanks for the link! I'll be sure to check it out later; it looks interesting.