Explore >> Select a destination
|
You are here 
|
mikelevins.github.io | ||
| | | | |
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. | |
| | | | |
www.notesfromandy.com
|
|
| | | | | [I'm posting this for some friends who have asked about Smalltalk.] "Smalltalk" refers to both the Smalltalk language and the Smalltalk environment. I've forgotten a lot about the environment, and even more about the standard libraries, but I remember the ... Continue reading ? | |
| | | | |
pointersgonewild.com
|
|
| | | | | Static vs Dynamic: Why not Both? | |
| | | | |
sookocheff.com
|
|
| | | In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: | ||
