> A language that is Turing complete at compile means that an IDE cannot reliabl... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		dependenttypes on June 12, 2020 \| parent \| context \| favorite \| on: Forth implemented in Rust trait system > A language that is Turing complete at compile means that an IDE cannot reliably tell whether code has a syntax error without running a program that can take arbitrarily wrong. A language that is not Turing complete at compile-time does not necessarily mean that an IDE will be able to reliably tell whether a certain piece of code has a syntax error without running a program that can take an arbitrarily amount of time to finish.

btilly on June 13, 2020 [–]

It is possible to construct counterexamples, but in practice it tends to work out much, much better.

The various tools built around Java stand as an example.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact