4 ms·
This isn't a problem at all for modern type systems. OCaml, Haskell, and even C++ have Turing complete type systems and this is one of the last concerns for dev
by viuphiet 6y ago
This isn't a problem at all for modern type systems. OCaml, Haskell, and even C++ have Turing complete type systems and this is one of the last concerns for developers.
- mannerheim 6y agoI believe Haskell's type system is only Turing complete with UndecidableInstances or other extensions. But these extensions are not uncommon.