2 ms·
I'm not sure that's quite right. Haskell models the lambda calculus pretty closely, but it has one of the most complicated type systems known to man. In its mod
by chc 15y ago
I'm not sure that's quite right. Haskell models the lambda calculus pretty closely, but it has one of the most complicated type systems known to man. In its modern form, the type system is Turing-complete. The type system itself is capable of universal computation.
The thing is just that type systems tend to be more usable in lambda calculus languages.
- wbhart 15y agoYou mean that Haskell has one of the most complex of the practical type systems known to man. For example (correct me if I am wrong) but the Haskell type system does not allow specification of dependent types (though dependent typing can be simulated after a fashion). Haskell with extensions does have a Turing-complete type system though (I actually don't know what this means, but the internets says so -- perhaps someone can tell me the difference between Haskell and Haskell with extensions).