News for hackers. Stuff that matters.
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by dvt on Friday March 10, 2017 @10:15PM (#13844005)
Because it's not necessary. If a Turing-complete programming language can't be expressive enough without a Turing-complete metalanguage, then it's probably not designed very well.

What next? Will we start seeing meta-metalanguages because, hey, it makes compilation less error-prone (but adds something we'll call pre-compilation)?

Re:Rust's Type System Is Turing-Complete: Type-Level Program... by pcwalton on Saturday March 11, 2017 @01:31PM (#13846497)
> If a Turing-complete programming language can't be expressive enough without a Turing-complete metalanguage, then it's probably not designed very well.

What is your proposed alternative to the Paterson conditions (described in the top comment)?

Re:Rust's Type System Is Turing-Complete: Type-Level Program... by clock_tower on Friday March 10, 2017 @10:44PM (#13844095)
I think C/C++ #ifdefs could qualify as a meta-meta-language. I've certainly found that there are situations where static analysis can't comprehend C++ without pre-compilation...
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by dvt on Friday March 10, 2017 @10:56PM (#13844129)
Yes, I think you're right, actually. I doubt the C/C++ pre-processor is Turing-complete, though.
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by jepler on Friday March 10, 2017 @11:50PM (#13844293)
"yes-ish" it is turing complete http://stackoverflow.com/questions/3136686/is-the-c99-prepro... (read the second answer, not the accepted answer)
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by dvt on Saturday March 11, 2017 @12:01AM (#13844317)
Wow, TIL. Good find!