On 12/26/12 9:42 AM, Russel Winder wrote:
On Tue, 2012-12-25 at 11:37 -0800, Walter Bright wrote:
I've often heard that claim, but here's an article with what the substance is:
http://dubhrosa.blogspot.co.uk/2012/12/lessons-learning-haskell.html?m=1
Note that D offers this style of programming, with checkable purity,
immutability and ranges. I think it is a very important paradigm.
Does D do tail recursion optimisation?
Yah, but not tail calls. (That should be on the list...)
Can the D compiler check to enforce *NO* (or at the worst single)
assignment to a variable?
Only for immutable data.
Andrei
