No, dynamic type systems are not inherently more open

Internet debates about typing disciplines continue to be plagued by a pervasive myth that dynamic type systems are inherently better at modeling “open world” domains. The argument usually goes like this: the goal of static typing is to pin everything down as much as possible, but in the real world, that just isn’t practical. Real systems should be loosely coupled and worry about data representation as little as possible, so dynamic types lead to a more robust system in the large.

Internet debates about typing disciplines continue to be plagued by a pervasive myth that dynamic type systems are inherently better at modeling “open world” domains. The argument usually goes like this: the goal of static typing is to pin everything down as much as possible, but in the real world, that just isn’t practical. Real systems should be loosely coupled and worry about data representation as little as possible, so dynamic types lead to a more robust system in the large. This story sounds compelling, but it isn’t true. The flaw is in the premise: static types are not about “classifyin

saved by

• João Araújo

related reading

• "We're building a new static type checker for Python" | Hacker Newsnews.ycombinator.com
• Type system - Wikipediaen.wikipedia.org
• Parse, don’t validatelexi-lambda.github.io
• Reading 1: Static Checkingweb.mit.edu
• Reading 1: Static Checkingweb.mit.edu
• TypeScript: Documentation - The Basicstypescriptlang.org
• Leaving Haskell behind - Infinite Negative Utilityjournal.infinitenegativeutility.com
• Pyrefly vs. ty: Comparing Python’s Two New Rust-Based Type Checkers | Edward Li's Blogblog.edward-li.com
• 2. Variable and Type - CS2030S Programming Methodology IInus-cs2030s.github.io
• TypeScript: Documentation - TypeScript for the New Programmertypescriptlang.org
• Static typing - Glossary | MDNdeveloper.mozilla.org
• Reading 11: Recursive Data Typesweb.mit.edu