[Haskell] The GHC typechecker is Turing-complete

[Lennart Augustsson]

Just a somewhat related fact:

A standard Hindley-Milner type checker (deducer) has the same power  
as a Turing machine with a finite tape.  I.e., the same power as a  
computer, since they have finite memory. :)

	-- Lennart

On Aug 10, 2006, at 22:04 , Robert Dockins wrote:
...