Timeline for Alternatives to tracing GC for dynamically-typed languages
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15 at 21:45 | answer | added | Matt Timmermans | timeline score: 2 | |
| Oct 14 at 21:07 | comment | added | apropos | I am very curious: could you talk a little bit more about why you're interested in dynamically typed languages in particular? I haven't heard of memory management approaches differing fundamentally by dynamic vs. static typing before... (probably b/c I am only familiar with the details of statically typed languages) | |
| Oct 14 at 5:51 | comment | added | MisterMiyagi | Note that CPython primarily relies on reference counting with the cycle detecting GC being optional (though on by default). PyPy relies only on GC. There are quite a few programs for which the distinction matters in practice. | |
| Oct 14 at 3:10 | comment | added | Moonchild | do you object to real-time tracing gc? this would likely provide better throughput without sacrificing 'predictability' | |
| Oct 14 at 0:43 | comment | added | Bbrk24 | It is possible to add cycle detection on top of RC without having to do a full "stop the world" trace. I believe PHP does this; see Bacon and Rajan's 2001 paper for an example, though I'm sure there have been other versions of this. | |
| Oct 14 at 0:27 | history | asked | Greg Nisbet | CC BY-SA 4.0 |