News for hackers. Stuff that matters.
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by lomnakkus on Friday March 10, 2017 @10:09PM (#13843983)
If only. Prolog is actually reasonably pleasant to program in.

Accidentally Turing Complete type systems are usually not all that pleasant in practice. Examples: C++ Templates, and now it seems, Rust.

EDIT: Just because people may not know this: A relevant quote by Alan Perlis: "Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy." This applies to type-level programming as it does any type of programming.

EDIT#2: Also, look into Shen for a principled way to do this type of thing.

Re:Rust's Type System Is Turing-Complete: Type-Level Program... by dkarapetyan on Friday March 10, 2017 @10:29PM (#13844050)
Hence the ad-hoc part. I don't think people go into writing a type checker and type inferencer thinking they're gonna re-implement Prolog.
Re:Rust's Type System Is Turing-Complete: Type-Level Program... by PeCaN on Saturday March 11, 2017 @12:42AM (#13844413)
OTOH, if you're a Prolog programmer and you write a type checker, you rather quickly realize what's going on ;-)