There's a common belief floating around that total functions are an essential component of functional programming. I suppose there's growing demand for developing in Turing-incomplete languages.
-
-
Or maybe another way to say this: the type system may not be (quite) turing complete, but the language is. This is probably true of essentially all mainstream languages.
-
I think that is akin to claiming that all recursive functions are total, because they have a finitary representation. One could alter the runtime semantics of so that the program terminates after n recursive calls. But is that a satisfactory definition of totality?
- 2 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.