4 ms·

Functional Programming in Java

• ggm 4y ago
  It may be faulty understanding on my part because I live in the imperative domain, but I am told by FP people I like that the killer reason its opimisable (after the type checking, compile time stuff, preservation of abstraction state, you name it) is tail recursion and lazy eval. I always find myself asking, if these "FP in xxx (imperative> language" discuss the consequences of taking FP algorithms which depend on lazy eval and/or tail recursion, which may cause stack/heap fails if done naievely.