25 Jul
2011
25 Jul
'11
9:16 p.m.
Hi Davi! On 25.07.2011 22:05, Davi Santos wrote:
Hello, which would be the minimal Haskell concepts subset equivalent to a Turing-complete high level language? I bet there would be no monads and type classes in the subset.
You'd need very little for Turing completeness. But what constitutes a "high level language"? Regards, Thomas