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.
[ Parent
| on HN ]
There are no comments on this comment yet.