Explore >> Select a destination
|
You are here 
|
davmac.wordpress.com | ||
| | | | |
weblog.raganwald.com
|
|
| | | | | ||
| | | | |
nurkiewicz.com
|
|
| | | | | When choosing or learning a new programming language, type system should be your first question. How strict is that language when types don't really match? Will there be a conservative, slow and annoying compiler? Or maybe a fast feedback loop, often resulting in crashes at runtime? And also, is the language runtime trusting you know what you are doing, even if you don't? Or maybe it's babysitting you, making it hard to write fast, low-level code? Believe it or not, I just described static, dynamic, weak and strong typing. | |
| | | | |
programmingmadecomplicated.wordpress.com
|
|
| | | | | There are these things that, depending on your definition, many or all programming languages use: 'types'. There's also a rich mathematical study of types in Type Theory which, along with related disciplines, has many connections to logic and proof. Why? Often, they take the form of explicit 'annotations' to program artefacts, big and small. For... | |
| | | | |
matthiasnoback.nl
|
|
| | | |||
