On Sep 27, 2013 2:12 PM, "Marc Feeley" feeley@iro.umontreal.ca wrote:
Cute. However, tail-recursion is not a feature of functional programming
languages in general. In fact, Scheme (and assembler!) are the only languages I know where tail-recursion is guaranteed.
"Functional programming" these days usually implies a strong type system, laziness, and purity. In other words it usually means "Haskell". And Haskell, afaik, does guarantee TCO, as do the ML.