Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with recursion
Search options not deleted
user 2909
Questions about objects such as functions, algorithms or data structures that are expressed using "smaller" instances of themselves.
2
votes
Is it beneficial to convert recursion to tail recursion?
Any recursion can be converted into tail recursion by transforming the function into continuation-passing style.
The continuations being built can be defunctionalized (a-la John C. … As you can see, there's no recursion - the function itself is even unnamed. …
- 299
2
votes
Tail call optimization via translating to CPS
Somehow turn the opaque lambdas
next_cont = lambda result: current_cont(current_value * result)
into transparent data
next_cont = Compose( current_cont, Mult(current_value))
then use the fact that
…
- 299