News for hackers. Stuff that matters.
Re:On Learning Haskell by mnemonicsloth on Wednesday March 10, 2010 @01:28PM (#1181572)
Haskell pushes [static typing] to some sort of logical limit.

I think that distinction should go to Qi. Derived from Common Lisp, but with a type system that's Turing-complete.

http://www.lambdassociates.org/doc.htm

Re:On Learning Haskell by Periodic on Wednesday March 10, 2010 @02:33PM (#1181735)
I believe GHC's type system is also Turing complete. As an example, you can implement BrainFuck in the GHC type system. I haven't looked over the details, but it looks promising.

http://killersmurf.blogspot.com/2009/11/typefuck.html

Re:On Learning Haskell by camccann on Wednesday March 10, 2010 @02:54PM (#1181791)
Type-level computation is actually quite limited by default in GHC; it becomes quasi-Turing-complete only when using the UndecidableInstances extension, and even then it has a very shallow stack by default, though you can increase it if you want deeper recursion. If memory serves me, Oleg Kiselyov has a type-level implementation of the untyped lambda calculus, which is rather more pleasant than brainfuck.
Re:On Learning Haskell by sreque on Wednesday March 10, 2010 @03:00PM (#1181803)
Isn't c++'s type system also turing complete via templates?

http://stackoverflow.com/questions/189172/c-templates-turing...

Re:On Learning Haskell by eru on Wednesday March 10, 2010 @04:11PM (#1181999)
Yes, but in the same sense that Brainfuck is..