2 ms·
It's pretty weird. It's a very strongly statically typed lazily evaluated pure functional language with a type system that is actually Turing-complete.
by chc 13y ago
It's pretty weird. It's a very strongly statically typed lazily evaluated pure functional language with a type system that is actually Turing-complete.
- njs12345 13y agoThe type system isn't Turing-complete by default, you need to enable a fair number of extensions: http://www.haskell.org/haskellwiki/Type_SK http://www.haskell.org/haskellwiki/Type_SK