Timeline for Difference between statically and dynamically typed languages
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2019 at 21:34 | answer | added | Martin Berger | timeline score: 2 | |
| Jun 1, 2019 at 17:26 | history | edited | InsideLoop |
edited tags
|
|
| Jun 1, 2019 at 16:34 | history | migrated | from stackoverflow.com (revisions) | ||
| Jun 1, 2019 at 16:33 | comment | added | Robert Harvey | Alright. I'm going to migrate your question to Theoretical Computer Science. Stand by while I pull the levers. [whooshing sound] | |
| Jun 1, 2019 at 16:33 | comment | added | InsideLoop | @Robert. It is in France where things get theoritical very early. Let's say that a Turing-complete machine is introduced in the same course ! | |
| Jun 1, 2019 at 16:31 | comment | added | InsideLoop | @Robert. Unfortunately, they learn OCaml which is statically typed. Although OCaml programs can be compiled, they never do it and only use a REPL. Therefore they use a statically-typed language which is not really "compiled". | |
| Jun 1, 2019 at 16:31 | comment | added | glennsl | I'm voting to close this question as off-topic because it belongs on cs.stackexchange.com. SO is for practical programming problems. | |
| Jun 1, 2019 at 16:29 | comment | added | Robert Harvey | Is this a theoretical computer science class, or a software engineering class? | |
| Jun 1, 2019 at 16:25 | comment | added | Robert Harvey | I am a teacher of both C and Java, and I find that wringing hands over word definitions like this is not productive. Here is a workable definition: a statically typed language can detect type errors at compile time. | |
| Jun 1, 2019 at 16:22 | history | asked | InsideLoop | CC BY-SA 4.0 |