Timeline for Update a function avoiding infinite recursion
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2013 at 0:29 | comment | added | Stefano | Thank you very much for the remark. Actually, I meant the definition with := instead of =. Indeed, the last does not seem to give problems in the simple example above. I am quite new to functional programming in general. I am try to implement some kind of fixed point algorithm where the unknown are functions: what design would you suggest in this case? (obviously the issue above is an outcome of my background in procedural programming) | |
| Mar 21, 2013 at 20:11 | comment | added | Szabolcs | Does this answer your question at all? I'm not sure I understand it. Leonid's answer is interesting and useful, but it's not really a basic one. I thought it's educational to add this very basic comment. | |
| Mar 21, 2013 at 17:45 | history | answered | Szabolcs | CC BY-SA 3.0 |