Timeline for Why don't compilers automatically insert deallocations?
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 18, 2017 at 3:51 | comment | added | Paul Draper |
This is irrelevant. If it's undecidable for all compilers, it's undecidable for all humans too. Yet we expect humans to insert free() correctly.
|
|
Jan 18, 2017 at 2:41 | comment | added | user541686 | @TikhonJelvis: I believe he's saying that this was the reason why this approach wasn't pursued. I don't think he's saying that it shouldn't be pursued, or that this is necessarily a good reason. | |
Jan 17, 2017 at 2:28 | comment | added | Tikhon Jelvis | Lots of things compilers do happily are undecidable in general; we wouldn't get anywhere in the compiler world if we always caved to Rice's theorem. | |
Jan 15, 2017 at 11:45 | comment | added | Raphael | Guys, take it to chat. Everything that does not directly relate to the answer itself and how it can be improved will be deleted. | |
Jan 13, 2017 at 10:37 | vote | accept | Milton Silva | ||
S Jan 13, 2017 at 9:04 | history | mod moved comments to chat | |||
S Jan 13, 2017 at 9:04 | comment | added | Gilles 'SO- stop being evil' | Comments are not for extended discussion; this conversation has been moved to chat. | |
Jan 13, 2017 at 0:12 | history | edited | David Richerby | CC BY-SA 3.0 |
added 13 characters in body
|
Jan 12, 2017 at 20:40 | comment | added | David Richerby | We have a question that covers humans' ability to solve undecidable problems. I can't give you an example of a program that would be compiled incorrectly because that depends on what algorithm the compiler uses. But any algorithm will produce incorrect output for infinitely many different programs. | |
Jan 12, 2017 at 20:02 | history | answered | David Richerby | CC BY-SA 3.0 |