Hacker News new | ask | show | jobs
by DougBTX 5991 days ago
Not all languages, but many: http://en.wikipedia.org/wiki/Turing_completeness#Examples
1 comments
chancho 5991 days ago
From that wikipedia page: "The untyped lambda calculus is Turing-complete, but many typed lambda calculi, including System F, are not."

Anyone have any details about System F not being turing complete? Is it not straightfoward to implement an untyped lambda calculus in a typed one?

link