3 ms·
> If complexity is based on how likely a syntactically correct program is also logically correct, then type systems remove a lot of complexity. Types are not r
by excursionist 7y ago
> If complexity is based on how likely a syntactically correct program is also logically correct, then type systems remove a lot of complexity.
Types are not really at the syntax level. I would measure the complexity of a language by the complexity of it's grammar and the size of the standard library/amount of common idioms needed to write most programs in a reasonable way.