Genuinely trying to understand. Argued from first principles: Since TS is a superset of JS, we can assert that the both constitute opposite ends on the spect

Genuinely trying to understand. Argued from first principles: Since TS is a superset of JS, we can assert that the both constitute opposite ends on the spectrum of static typing. Thus, surely there are infinitely many levels of possible gracefulness in-between? IOW: If JS can live with no constraints, then why can't TS live with with slightly more graceful ones than the current?