Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


The type system isn't Turing-complete by default, you need to enable a fair number of extensions: http://www.haskell.org/haskellwiki/Type_SK




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: