2 ms·
> 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
by pcwalton 10y ago
> 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)?