3 ms·
> In practice it just means the compiler can't be proved to halt on valid code. Which is a terrible outcome, and isn't a problem for nearly any other language
by naasking 10y ago
> In practice it just means the compiler can't be proved to halt on valid code.
Which is a terrible outcome, and isn't a problem for nearly any other language save C++.
- gpderetta 10y agoPlenty of languages today have Turing complete type systems. I believe even Haskell with GHC extensions is.
- curried_haskell 10y agoScala's type system is also turing complete. They sometimes use type lambdas to get around some of the inexpressiveness of the type system.