No, that’s not what I’m asking. Static languages traditionally have well-defined rules about what qualifies as a well-typed program and what doesn’t. These rules are part of the definition of the language and guarantee that the compiler can determine what the types of all values are. I cannot find any such rules explained anywhere for Nim. I’d like to know what they are.
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| What do you think about the programming language NIM? | 27 | 15151 | August 24, 2020 | |
| Can we bring dynamically typed languages back into trend? | 74 | 5382 | November 12, 2023 | |
| Suggestion: introduce something like a @inferable or @typestable macro to the language | 30 | 1592 | August 21, 2022 | |
| Comparison of Julia with statically typed languages | 10 | 2387 | June 9, 2024 | |
| Does Julia Create a "1.5" Language Problem? | 133 | 6762 | January 1, 2024 |