Hacker News Reader

capicueon What to know before debating type systems (2010)

From a theoretical perspective, preventing infinite loops is in a very deep sense the most basic possible thing you can do with static types! The simply-typed lambda calculus, on which all other type systems are based, proves that programs terminate in a finite amount of time.

Is this not claiming that static typing (and/or lambda calculus) solves the halting problem?

capicueon G()('al')

But it requires eval-ing a string literal instead of actually having g()("al") as an expression itself