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)?
What is your proposed alternative to the Paterson conditions (described in the top comment)?