Is there any reason (theoretical or otherwise) for the lack of a processor/architecture which more closely corresponds to the functional way of programming? Or, a similar question, is there any theoretical limit to how efficient an interpreted language such as Haskell can be on the architectures of today? And on debugging: It may be hard to debug functional code, but it is atleast easier to mathematically prove that they work in the first place:-)
Slashdot Mirror
Is there any reason (theoretical or otherwise) for the lack of a processor/architecture which more closely corresponds to the functional way of programming? :-)
Or, a similar question, is there any theoretical limit to how efficient an interpreted language such as Haskell can be on the architectures of today?
And on debugging: It may be hard to debug functional code, but it is atleast easier to mathematically prove that they work in the first place