TypeScripts Type System Is Turing Complete

Re:TypeScripts Type System Is Turing Complete by fauigerzigerk on Wednesday August 02, 2017 @08:15AM (#14909866)

It doesn't mean useful, but in my opinion it definitely means powerful. Being expressive enough to describe any possible algorithm is a power. No self respecting super hero would deny that, not even TypeScript's worst enemy.

But with every power comes a weakness. Compile times can no longer just seem endless. They can actually be endless, and there is no way to prove otherwise.

What I find unconvincing about many Turing complete type systems is that pragmatically speaking they are really shitty general purpose programming languages.

If we create Turing complete type systems and suffer the consequences, why not go all the way and make it actually practical to write proper meta programs the way Lisp has done?

[ Parent | on HN ]

Re:TypeScripts Type System Is Turing Complete by bad_user on Wednesday August 02, 2017 @09:02AM (#14910162)

I kind of disagree, describing any possible algorithm is not that powerful, given that an actual Turing machine can do it.

And along with Turing machines you've got problems, like undecidability and the halting problem.

[ Parent | on HN ]