Timeline for Are lessons on tail recursion transferable to languages that don't optimize for it?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27, 2021 at 15:49 | answer | added | gnasher729 | timeline score: 1 | |
| Nov 27, 2021 at 12:55 | comment | added | Thorbjørn Ravn Andersen | Tail-call recursion can be done in any language. If tail-call optimization is not being done which turns the call into a loop, then this is done at the expense of the stack. | |
| Nov 16, 2020 at 19:06 | vote | accept | J. Mini | ||
| Nov 15, 2020 at 21:20 | answer | added | Jörg W Mittag | timeline score: 5 | |
| Nov 15, 2020 at 21:07 | answer | added | JacquesB | timeline score: 2 | |
| Nov 15, 2020 at 20:58 | comment | added | Doc Brown | As far as I remember, the first 3 chapters of SICP are about creating functional abstractions, creating data abstractions, and creating abstractions with objects/mutability/state. These topics are pretty independent from examples being implemented using recursion, or being implemented using standard iterations / loops. | |
| Nov 15, 2020 at 18:56 | review | Close votes | |||
| Nov 30, 2020 at 3:04 | |||||
| Nov 15, 2020 at 18:48 | comment | added | amon | Tail-call optimization depends a lot on the language and on the language's implementation. E.g. Java/OpenJDK and Python/CPython do not offer automatic TCO, but C++/GCC does. Of course you can manually transform a tail-recursive solution into a solution using loops, if necessary. Some programming advice in SICP is specific to their LISP flavour, but the more general advice about problem solving are universal. | |
| Nov 15, 2020 at 18:42 | review | First posts | |||
| Nov 20, 2020 at 11:11 | |||||
| Nov 15, 2020 at 18:39 | history | asked | J. Mini | CC BY-SA 4.0 |