3 ms·Exactly—Haskell’s type checker can be made Turing-complete, but that won’t make it much like Prolog.by klodolph 1y agoExactly—Haskell’s type checker can be made Turing-complete, but that won’t make it much like Prolog.