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.
-
-
Thanks for sharing. I’ve attended your talk on total prgramming in Idris and it was very interesting. But it seems those type systems are capable of proving totality for special cases of well-founded recursion? There are total recursive functions outside that classification.
-
Of course, there'll always be things you can't decide. The challenge is to learn how to spot more of them. But even within current constraints, you can still have Turing completeness.
- 5 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.