3 ms·
With the right combination of language extensions, you can force Haskell's type system to turing-completness; see http://www.haskell.org/haskellwiki/Type_SK htt
by jmillikin 16y ago
With the right combination of language extensions, you can force Haskell's type system to turing-completness; see http://www.haskell.org/haskellwiki/Type_SK http://www.haskell.org/haskellwiki/Type_SK
- eru 16y agoYes. But if nothing else is said, I expect people to talk about the standard Haskell 98. C++'s type system is isomorph to lambda calculus even without extensions, and nobody made this joke there.