[dvt]

> Would it be so bad to write a Turing complete static check function?

I think most type systems are, in fact, Turing complete (there's a fun proof somewhere that TypeScript is, for example). And most typed languages (Go, C++, Java, TypeScript) have pretty mature static type-checkers, unless I'm misunderstanding your ask.

[creata]

"Typing is Hard" is a popular list of languages and the decidability of typechecking in them: https://3fx.ch/typing-is-hard.html

[sva_]

That's a nice list

> Zig

> undecidable, since evaluation of recursive functions at compile time is possible, thus requiring the compiler to solve the halting problem.

For some reason, I find that amusing.