tag:blogger.com,1999:blog-7577421612120825312.post8969913439444357627..comments2009-12-28T20:19:20.169ZSamhttp://www.blogger.com/profile/01345100698738870730noreply@blogger.comBlogger9125tag:blogger.com,1999:blog-7577421612120825312.post-55321860836745289792009-12-28T20:19:20.169Z2009-12-28T20:19:20.169ZNice post!Saliya Ekanayakehttp://www.blogger.com/profile/10281589417412608237noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-88800627562544775542009-11-16T13:12:43.595Z2009-11-16T13:12:43.595ZGlad you liked it GJ!Samhttp://www.blogger.com/profile/01345100698738870730noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-39158029009731741702009-11-16T13:07:06.539Z2009-11-16T13:07:06.539ZHi Sam,<br /><br />EXCELLENT article, immediately put you on my iGoogle rss. <br /><br />I work with C# code generated with a DSL, so users can easily create stackoverflows. (Because they don;t know about all that.)<br /><br />This trampolining approach seems like a possible solution to some of those problems.<br /><br />Thanks, GJAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-18710176290676347932008-12-31T08:29:00.000Z2008-12-31T08:29:00.000ZTristan,<BR/> Thanks. It's a real encouragement when I get comments like that. I shall have to get a move on with the next Project Euler post!<BR/><BR/>SamSamhttp://www.blogger.com/profile/01345100698738870730noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-13146358861335424542008-12-30T17:31:00.000Z2008-12-30T17:31:00.000ZHey, just another comment to tell you that there are other people out there who enjoy your articles and find them useful. I'm in that intersection of people who like math and want to learn more functional programming. I'm working along on the Project Euler problems, and trying to only use your posts as a hint. It's really fun! Thanks again.Tristanhttp://www.blogger.com/profile/11770063054853613781noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-22036723018854088672008-11-21T09:02:00.000Z2008-11-21T09:02:00.000ZDan,<BR/> I shall have to hire you as my proof-reader :-)<BR/><BR/>Keep the feedback coming - it's great to know that people are enjoying my articles and finding them useful. Please consider giving star ratings to any posts you particularly like (or dislike!).Samhttp://www.blogger.com/profile/01345100698738870730noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-30828887138720007782008-11-21T07:45:00.000Z2008-11-21T07:45:00.000ZThere's also a second wrong link in the begining, at<BR/>"Anybody using Recursion to write functions, as we did in the last episode, should be aware of the major pitfall: Stack Overflow".<BR/><BR/>Sorry, I tend to be a bit too perfectionist.<BR/><BR/>I should also add that I liked this article. Great explaining of the stack overflow issue.Dan Dumitrunoreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-20276157959063307532008-11-20T15:58:00.000Z2008-11-20T15:58:00.000ZDan,<BR/> Thanks for letting me know about this: it should be fixed now.<BR/><BR/>SamSamhttp://www.blogger.com/profile/01345100698738870730noreply@blogger.comtag:blogger.com,1999:blog-7577421612120825312.post-14353585315672899722008-11-20T15:22:00.000Z2008-11-20T15:22:00.000ZJust a small notice: you have two links pointing to Problem 4, when you are obviously modifying the method you used on Problem 3.<BR/><BR/>It confused me a bit in the begining. I was wondering what is so recursive about Problem 4 :)Dan Dumitrunoreply@blogger.com