The plague of dynamic type checking

I am legitimately unsure why would anyone intentionally use dynamic over static type checking. It's almost as if they don't value safety nor speed.

>>2

without inference

The HM type inference algorithm for simply typed lambda calculi was first published in 1969 and was independently discovered multiple times due to its simplicity. Any language without type inference is a bad hack published by clueless assholes.

without bloating your're are binary size

Static type checking does not influence the binary size in any negative way.

static languages are getting better now

Languages designed with static type checking in mind were good since a long time ago. SML was published in 1990!.

C/Java/Pascal way tended to be tedious

The funny thing is that the type system of these languages was so simple that type inference would be extremely easy in them.

while the Haskal way was too focused on academic category theory

Was it?

with optional static typing

Why optional?

less tedious to use thran tRacket

Typed Racket seems simple enough though. Is there something specific that you do not like?