Cool Monday - Hindley-Milner on a dynamic language

So I’m getting into type theory. Slowly. Note to self: read a proper book on this topic. I’m getting familiar with it through some practical applications. Namely scala and haskell. 

That same discussion about design patterns also included dynamic vs static typing. And I asked twitter about it. HairyFotr linked this amazing talk about type inference to me. Basically there are two conclusions to be drawn

• Every static typed language should have at least limited type inference. It’s compiler’s job to do so and quite trivial to implement.
• Properly done static typed language provides all features the that dynamic typed languages can. Safely.

As I’m (still) implementing a language that happens to be dynamic(because I was too lazy to look-up how to do type checking) second point interests me more.