News for hackers. Stuff that matters.

A comment on Programming languages and their relationship styles. Parent comment

Re:Programming languages and their relationship styles by eru on Thursday February 17, 2011 @07:11PM (#2233524)
> It's a reference to Haskell's extremely elaborate Turing-complete type system [...]

Haskell's type system is decidable. Thus it can't be Turing complete.

[ Parent | on HN ]
Re:Programming languages and their relationship styles by jmillikin on Thursday February 17, 2011 @07:20PM (#2233561)
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
[ Parent | on HN ]
Re:Programming languages and their relationship styles by eru on Friday February 18, 2011 @07:17AM (#2235146)
Yes. 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.

[ Parent | on HN ]