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.
The idea is that you can describe general recursion, or partiality, in much the same way as you can describe interactive programs.
-
-
Running general recursive programs requires a (very small) driver, but I don't consider this an issue because so does evaluation and execution in general.
-
And one could easily imagine a total, turing complete language, where such a driver is part of the run time system in the same way as a driver for executing effects (like Idris/Haskell have)
- 1 more reply
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.