Timeline for What can qualify for potential tail call recursion (TCO) optimization or tail recursion elimination (TRE)
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Jan 21, 2016 at 11:26 | history | tweeted | twitter.com/StackProgrammer/status/690133252393271296 | ||
| Jan 11, 2016 at 7:14 | comment | added | John R. Strohm | Short answer: Read the various "Lambda: The Ultimate" papers from the MIT AI Lab. They go into a great deal of detail on, among other things, tail recursion and tail call elimination. | |
| Jan 10, 2016 at 22:31 | history | edited | nonopolarity | CC BY-SA 3.0 |
added 141 characters in body
|
| Jan 10, 2016 at 18:33 | history | edited | user40980 | CC BY-SA 3.0 |
Nice names for links.
|
| Jan 10, 2016 at 18:29 | answer | added | amon | timeline score: 3 | |
| Jan 10, 2016 at 18:10 | answer | added | walpen | timeline score: 6 | |
| Jan 10, 2016 at 17:29 | answer | added | Bart van Ingen Schenau | timeline score: 1 | |
| Jan 10, 2016 at 17:07 | history | asked | nonopolarity | CC BY-SA 3.0 |